OMEGA_Sapper

#include <iostream>
#include <vector>
#include <cmath>
#include <valarray>
#include <string>
#include <algorithm>
#include <sstream>
#include <set>
using namespace std;
int main()
{
    long long int MONKOHEAD,summ,k,n,i,j,m,ma,c,o,x,c1,i1,i2,i3,j1,j2,mi,q,OMEGAHEAD;
    cin>>n>>m;
    cin>>c;
    char a[34][34];
    for (int i=0;i<n+2;i++){
        for (int j=0;j<m+2;j++){
            a[i][j] = '0';
        }
    }
    MONKOHEAD=0;
    for(int i=0;i<c;i++){
        cin>>i1>>j1;
        a[i1][j1]='*';
    }
    for (int i=1;i<n+1;i++){
        for (int j=1;j<m+1;j++){
            if (a[i][j]!='*'){
                if (a[i-1][j]=='*')
                    ++MONKOHEAD;
                if (a[i-1][j-1]=='*')
                    ++MONKOHEAD;
                if (a[i-1][j+1]=='*')
                    ++MONKOHEAD;
                if (a[i+1][j+1]=='*')
                    ++MONKOHEAD;
                if (a[i+1][j-1]=='*')
                    ++MONKOHEAD;
                if (a[i+1][j]=='*')
                    ++MONKOHEAD;
                if (a[i][j-1]=='*')
                    ++MONKOHEAD;
                if (a[i][j+1]=='*')
                    ++MONKOHEAD;
                cout<<MONKOHEAD;
                MONKOHEAD=0;
            }
            else
                cout<<a[i][j];
            if (j!=m)
                cout<<" ";
        }
        cout<<endl;
    }
    return 0;
}