暴力即可
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (1000+10)
#define MAXK (100000+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
int n,m,k;
bool b[MAXN][MAXN]={0};
int main()
{
// freopen("Pixels.in","r",stdin);
// freopen(".out","w",stdout);
cin>>n>>m>>k;
For(i,k)
{
int x,y;
scanf("%d%d",&x,&y);
b[x][y]=1;
bool flag=0;
if (b[x-1][y]&&b[x-1][y-1]&&b[x][y-1]) flag=1;
if (b[x+1][y]&&b[x+1][y+1]&&b[x][y+1]) flag=1;
if (b[x-1][y]&&b[x-1][y+1]&&b[x][y+1]) flag=1;
if (b[x+1][y]&&b[x+1][y-1]&&b[x][y-1]) flag=1;
if (flag)
{
cout<<i<<endl;
return 0;
}
}
cout<<"0"<<endl;
return 0;
}