#include<fstream>
#include<iostream>
using namespace std;
int a[20][20],n,jo,i,j,maxx,amax[20][20];
ifstream f("r.in");

void afis(int a[20][20], int n)
{
 for(int i=1;i<=n;i++)
 {
	for(int j=1;j<=n;j++)
		if(a[i][j]==-1) cout<<"# ";
		else cout<<a[i][j]<<" ";
	cout<<endl;
 }
 cout<<endl;
 }

void back(int i, int j, int pas, int np)
{ int inou,jnou;
  if (i==n)
  {
      afis(a,n);
      if(np>maxx)
      {
          maxx=np;
          for(int l=1;l<=n;l++)
             for(int c=1;c<=n;c++) amax[l][c]=a[l][c];
      }
  }
  else
	 {
	   for(int k=-1;k<=1;k++)
	   {
	       inou=i+1; jnou=j+k;
	       if(a[inou][jnou]==0 && k==0)
	       {
	           a[inou][jnou]=pas+1; back(inou,jnou,pas+1,np); a[inou][jnou]=0;
	       }
	       else if(a[inou][jnou]==-1 && k!=0)
	       {
	           a[inou][jnou]=pas+1; back(inou,jnou,pas+1,np+1); a[inou][jnou]=-1;
	       }
	   }
	 }
  a[i][j]++;
}

int main()
{  f>>n;
   for(i=1;i<=n;i++)
	    for(j=1;j<=n;j++)
				f>>a[i][j];

   f>>jo;
   a[1][jo]=1;
   back(1,jo,1,0);
   cout<<"ia maxim"<<maxx<<" piese si solutia este\n";
   afis(amax,n);
   return 0;
}