#include<bits/stdc++.h>
using namespace std;
int a, b, m;
vector<int>t[100005];
int have[100005];
int to[100005];
signed main(){
    cin >> a >> b >> m;
    for(int i = 1; i <= m; i++){
        int x, y;
        scanf("%d%d", &x, &y);
        if(x == a)to[y] ^= 1;
        else t[x].push_back(y);
    }
    for(int i = 1; i < a; i++){
        int len = t[i].size();
        for(int j = 0; j < len; j++){
            have[i] ^= 1;
            to[t[i][j]] ^= 1;
            to[b] ^= 1;
        }
    }
    int ans = 0;
    int s1 = 0, s2 = 0;
    for(int i = 1; i < a; i++)s1 += have[i];
    for(int i = 1; i < b; i++)s2 += to[i];
    ans = s1 + s2 - min(s1, s2);
    if(min(s1, s2) & 1)to[b] ^= 1;
    ans += to[b];
    cout << ans << endl;
    return 0;
}