using System;


namespace Ice
{
    class Program
    {
	static int addFlowSource(int[,] d, int [,,] fd,int[,] fs, int[,] ft ,bool[,] visited,int columns
			, int rows){
		for(int x=0;x<columns;x++){
			for(int y=0; y<rows; y++){
				if(!visited[x,y] && d[x,y] > fs[x,y]){
					int newFlow = addFlow(d,fd,fs,ft,visited,columns, rows,x,y,d[x,y]-fs[x,y]);
					if(newFlow==0)continue;
					fs[x,y]+= newFlow;
					return newFlow;
				}
			}
		}
		return 0;
	}
	static int addFlow(int[,] d, int [,,] fd,int [,] fs, int[,] ft, bool[,] visited,int columns, int rows, int x_1, int y_1, int flow){
		    visited[x_1,y_1]=true;
		    int newFlow = 0;
		    int[] neigboursX = {x_1+1,x_1+1,x_1,x_1-1,x_1-1,x_1-1,x_1,x_1+1};
		    int[] neigboursY = {y_1,y_1+1,y_1+1,y_1+1,y_1,y_1-1,y_1-1,y_1-1};

		    if(32-d[x_1,y_1] > ft[x_1,y_1]){
			   newFlow = Math.Min(flow,32-d[x_1,y_1]-ft[x_1,y_1]);
			   ft[x_1,y_1]+=newFlow;
			   visited[x_1,y_1]=false;
			   return newFlow;
		    }

		    for(int i=0;i<8;i++){
		    int x_2 = neigboursX[i];
		    int y_2 = neigboursY[i];
		    if(x_2>=0 && x_2<columns&&
		       y_2>=0 && y_2<rows
		       &&!visited[x_2,y_2]){
			    //forward 
			    int c_forward = 32-Math.Abs(d[x_1,y_1]-d[x_2,y_2]);
			    if(c_forward>fd[x_1,y_1,i]){
				   newFlow = Math.Min(flow,c_forward-fd[x_1,y_1,i]);
				   newFlow = addFlow(d,fd,fs,ft,visited,columns,rows,x_2,y_2,newFlow);
				   if(newFlow!=0){
					   fd[x_1,y_1,i]+= newFlow;
					   visited[x_1,y_1]=false;
					   return newFlow;
				   }
			    }
			    //backward
			    int c_backward = fd[x_2,y_2,(i+4)%4];
			    if(c_backward>0){
				   newFlow = Math.Min(flow,c_backward);
				   newFlow = addFlow(d,fd,fs,ft,visited,columns,rows,x_2,y_2,newFlow);
				   if(newFlow!=0){
					   fd[x_2,y_2,(i+4)%4]-= newFlow;
					   visited[x_1,y_1]=false;
					   return newFlow;
				   }
			    }
		    }}
		    visited[x_1,y_1]=false;
		    return 0;
	    }
	    static int maxFlow(int[,] d, int[,,] fd, int[,] fs, int[,] ft, int columns,int rows){
		    bool[,] visited = new bool[columns,rows];
		    //for(int i=0;i<n;i++){
		    //        visited[i]=false;
		    //}
		    while(addFlowSource(d,fd,fs,ft,visited,columns,rows)>0){}
		    int sum=0;
		    foreach(int s in fs){
			    sum+= s;
		    }
		    return sum;
	    }
	    static void printReachableSource(int[,] d, int[,,] fd,int[,] fs, int[,] ft,bool[,] visited, int columns, int rows){
		    visited[start]=true;
		    if(0<start&&start<n-1){
			    Console.WriteLine($"{(start-1)/columns} {(start-1)%columns}");
		    }
		    //forward
		    for(int j=0;j<n;j++){
			    if(!visited[j]&&c[start,j]>f[start,j]){
				    printReachable(c,f,visited,n,columns,rows,j);
			    }
		    }
		    //backward
		    for(int i=0;i<n;i++){
			    if(!visited[i]&&f[i,start]>0){
				    printReachable(c,f,visited,n,columns,rows,i);
			    }
		    }
	    }

	    static void Main(){
		    int rows = Int32.Parse(Console.ReadLine());
		    int columns = Int32.Parse(Console.ReadLine());
		    int mode = Int32.Parse(Console.ReadLine());

		    int[,] d = new int[columns,rows];
		    for(int y =0;y<rows;y++){
			    String[] rowstring = Console.ReadLine().Split();
			    for(int x=0;x<columns;x++){
				    d[x,y] = Int32.Parse(rowstring[x]);
			    }
		    }
		    //for(int x_1=0;x_1<columns;x_1++){
		    //        for(int y_1=0;y_1<rows;y_1++){
		    //    	    int x2 = (j-1)%columns;
		    //    	    int y2 = (j-1)/columns;

		    //    	    if(1==Math.Max(Math.Abs(x1-x2),Math.Abs(y1-y2))){
		    //    		    c[i,j] = 32 - Math.Abs(d[x1,y1]-d[x2,y2]);
		    //    	    }
		    //    	    else
		    //    		    c[i,j]=0;
		    //        }
		    //}
		    //for(int j=1;j<n-1;j++){
		    //        c[0,j] = d[(j-1)%columns,(j-1)/columns];
		    //}
		    //for(int i=1;i<n-1;i++){
		    //        c[i,n-1] = 32-d[(i-1)%columns,(i-1)/columns];
		    //}
		    //0=S, 1=A, 2=B, 3=C, 4=D, 5=T
		    //int n=6;
		    //int[,] c = 	{{0,10,0,10,0,0},//S
		    //        	 {0,0,4,2,8,0},//A
		    //    	 {0,0,0,0,0,10},//B
		    //    	 {0,0,0,0,9,0},//C
		    //    	 {0,0,6,0,0,10},//D
		    //    	 {0,0,0,0,0,0}//T
		    //		};
		    int[,,] fd = new int[columns,rows,8];
		    int[,] fs 		= new int[columns,rows];
		    int[,] ft 		= new int[columns,rows];
		    //for(int i=0;i<n;i++){
		    //for(int j=0;j<n;j++){
		    //        f[i,j]=0;
		    //}
		    //}
		    int flow = maxFlow(d,fd,fs,ft,columns,rows);
		    Console.WriteLine(flow);
		    if(mode==0)return;
		    bool[,] visited = new bool[columns,rows];
		    printReachableSource(d,fd,fs,ft,visited,columns,rows);
	    }
	    
    }
}