#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    int n,m,q;
    cin >> n >> m >> q;
    int ans = 0;
    vector<int> a(n), b(n), lis(n);
    rep(i,q){
        cin >> a[i] >> b[i];
        int length = 0;
        rep(j,i){
            if(a[j] < a[i] && b[j] < b[i]) length = max(lis[j],length);
        }
        lis[i] = length + 1;
        ans = max(lis[i],ans);
    }
    cout << ans << endl;
    return 0;
}