#include<iostream>
using namespace std;
int main(){
    int n,m,k,o,p,q,s,ans=0;
    cin>>n>>m>>k;
    int a[n+5][n+5];
    for(int i=1;i<=m;i++){
        cin>>o>>p;
        a[o+2][p]=1;
        a[o][p+2]=1;
        a[o-2][p]=1;
        a[o][p-2]=1;
        a[o+1][p]=1;
        a[o+1][p+1]=1;
        a[o+1][p-1]=1;
        a[o][p+1]=1;
        a[o][p]=1;
        a[o][p-1]=1;
        a[o-1][p]=1;
        a[o-1][p+1]=1;
        a[o-1][p-1]=1;
    }
    for(int i=1;i<=k;i++){
        cin>>q>>s;
        a[q-2][s-2]=1;
        a[q-2][s-1]=1;
        a[q-2][s]=1;
        a[q-2][s+1]=1;
        a[q-2][s+2]=1;
        a[q-1][s-2]=1;
        a[q-1][s-1]=1;
        a[q-1][s]=1;
        a[q-1][s+1]=1;
        a[q-1][s+2]=1;
        a[q][s-2]=1;
        a[q][s-1]=1;
        a[q][s]=1;
        a[q][s+1]=1;
        a[q][s+2]=1;
        a[q+1][s-2]=1;
        a[q+1][s-1]=1;
        a[q+1][s]=1;
        a[q+1][s+1]=1;
        a[q+1][s+2]=1;
        a[q+2][s-2]=1;
        a[q+2][s-1]=1;
        a[q+2][s]=1;
        a[q+2][s+1]=1;
        a[q+2][s+2]=1;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout<<a[i][j]<<" ";
        }
        cout<<endl;
    }
    cout<<ans;
    return 0;
}

数组越界怎麽办