#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define aLL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define F(i,j,k) fill(i[0],i[0]+j*j,k) #define P(p) cout<<(p)< vi; typedef vector vl; typedef vector vd; typedef pair pii; typedef pair pll; typedef long long ll; int dx[] = {0,1,0,-1}; int dy[] = {-1,0,1,0}; int sttoi(std::string str){int ret;std::stringstream ss;ss << str;ss >> ret;return ret;} int n; int mini = 10000000; bool field[10001]; int dp[10001]; list > lis; int main(){ int W,H,N; cin >> W >> H >> N; list suit,num; for(int i = 0;i < N;i++){ int a,b; cin >> a >> b; suit.push_back(a); num.push_back(b); } suit.unique();num.unique(); int w = suit.size(),h = num.size(); P(w*H + h*W - w*h - N); }