#include<bits/stdc++.h> using namespace std; struct city { int north; int south; }; city a[60001]; int n,i,d[60001],len,temp; bool cmp(city x,city y) { return x.north<y.north; } int main() { int x,y; cin>>x>>y; cin>>n; for(i=1; i<=n; i++) { cin>>a[i].north>>a[i].south; } sort(a+1,a+1+n,cmp); d[++len]=a[1].south; for(i=2; i<=n; i++) { int cityissb=upper_bound(d+1,d+len+1,a[i].south)-d; d[cityissb]=a[i].south; if(cityissb>len) { len++; } } cout<<len<<'\n'; return 0; }