#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
struct P{
int x,y;
};
P arr[10000];
bool cmp(P a,P b){
if(a.x==b.x)return a.y<b.y;
return a.x<b.x;
}
int main() {
int a, b, n,ans=0;
cin >> a >> b >> n;
for (int i = 0; i < n; ++i) {
cin>>arr[i].x>>arr[i].y;
}
sort(arr,arr+n,cmp);
for(int i = 0;i<n;i++){
while(i<n && abs(arr[i].x-arr[i+1].x)<3 &&abs(arr[i].y-arr[i+1].y)<3){
i++;
}
ans++;
}
cout << ans << endl;
return 0;
}
Share