#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef pair<int,int> P ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)

int n , m , q ;

ll A[1010] , B[1010] ;
ll dp[1010] ;

int main(){
    cin >> n >> m >> q ;
    rep(i,q) cin >> A[i] >> B[i] ;
    dp[0] = 1 ;
    rrep(i,1,q){
        ll val = 0 ;
        rep(j,i){
            if(A[j] < A[i] && B[j] < B[i]) val = max(val,dp[j]) ;
        }
        dp[i] = val + 1 ;
    }
    ll res = 0 ;
    rep(i,q) res = max(res,dp[i]) ;
    cout << res << endl ;
}