#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <functional>
#include <complex>
#include <queue>
#include <stack>
#include <cmath>
#include <cassert>
#include <cstring>
using namespace std;
typedef long long LL;
typedef complex<double> CMP;

class BreakingChocolate { public:
	int minSteps(int W, int H, vector <int> sx, vector <int> sy) 
	{
		
	}
};

// BEGIN CUT HERE
#include <ctime>
double start_time; string timer()
 { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
 { os << "{ ";
   for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
   os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
void verify_case(const int& Expected, const int& Received) {
 bool ok = (Expected == Received);
 if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
 cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
#define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
#define END	 verify_case(_, BreakingChocolate().minSteps(W, H, sx, sy));}
int main(){

CASE(0)
	int W = 3; 
	int H = 3; 
	int sx_[] = {2};
	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
	int sy_[] = {2};
	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
	int _ = 4; 
END
CASE(1)
	int W = 2; 
	int H = 2; 
	int sx_[] = {1,2};
	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
	int sy_[] = {2,1};
	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
	int _ = 3; 
END
CASE(2)
	int W = 10; 
	int H = 10; 
	int sx_[] = {1};
	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
	int sy_[] = {1};
	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
	int _ = 2; 
END
CASE(3)
	int W = 10; 
	int H = 10; 
	int sx_[] = {3,5,6};
	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
	int sy_[] = {5,5,5};
	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
	int _ = 6; 
END
CASE(4)
	int W = 3; 
	int H = 3; 
	int sx_[] = {1,1,1,2,2,3,3,3};
	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
	int sy_[] = {1,2,3,1,3,1,2,3};
	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
	int _ = 4; 
END
CASE(5)
	int W = ; 
	int H = ; 
	int sx_[] = ;
	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
	int sy_[] = ;
	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
	int _ = ; 
END
CASE(6)
	int W = ; 
	int H = ; 
	int sx_[] = ;
	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
	int sy_[] = ;
	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
	int _ = ; 
END

}
// END CUT HERE
