using System;


namespace Ice
{
    class Program
    {
	static int addFlowSource(int[,] d, int [,,] fd,int[,] fs, int[,] ft,int[] x,int[] y ,int columns
			, int rows){
		bool[,] visited = new bool[columns,rows];
		x[0]=0;
		while(x[0]<columns){
			y[0]=0;
			while(y[0]<rows){
				if(!visited[x[0],y[0]] && d[x[0],y[0]] > fs[x[0],y[0]]){
					int newFlow = addFlow(d,fd,fs,ft,visited,columns, rows,x[0],y[0],d[x[0],y[0]]-fs[x[0],y[0]]);
					if(newFlow!=0){
						fs[x[0],y[0]]+= newFlow;
						return newFlow;
					}
				}
				y[0]++;
			}
			x[0]++;
		}
		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++){
		    //while(index[x_1,y_1]<8){
		    //int i=index[x_1,y_1];
		    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[] x,int[] y, int columns,int rows){
		    //for(int i=0;i<n;i++){
		    //        visited[i]=false;
		    //}
		    while(addFlowSource(d,fd,fs,ft,x,y,columns,rows)>0){}
		    int sum=0;
		    foreach(int s in fs){
			    sum+= s;
		    }
		    return sum;
	    }
	    static void printReachable(int[,] d, int[,,] fd,int[,] fs, int[,] ft,bool[,] visited, int columns, int rows, int x, int y){
	            Console.WriteLine($"{y} {x}");
		    visited[x,y]=true;
		    int[] neigboursX = {x+1,x+1,x,x-1,x-1,x-1,x,x+1};
		    int[] neigboursY = {y,y+1,y+1,y+1,y,y-1,y-1,y-1};
		    for(int i=0;i<8;i++){
			    int x_2 = neigboursX[i];
			    int y_2 = neigboursY[i];
			    if(0<=x_2 && x_2<columns&& 0<=y_2 && y_2<rows&&!visited[x_2,y_2]){
			    	if(fd[x,y,i] < 32-Math.Abs(d[x,y]-d[x_2,y_2]) //forward
					||fd[x_2,y_2,(i+4)%4]>0) // backward
						printReachable(d,fd,fs,ft,visited,columns,rows,x_2,y_2);
			    }

		    }
	    }
	    static void printReachableSource(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(fs[x,y]<d[x,y]&&!visited[x,y]){
				    printReachable(d,fd,fs,ft,visited,columns,rows,x,y);
			    }
		    }
		    }
	    }

	    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_]);
			    }
		    }
		    
		    int[,,] fd = new int[columns,rows,8];
		    int[] x 	= {0};
		    int[] y 	= {0};
		    int[,] fs 		= new int[columns,rows];
		    int[,] ft 		= new int[columns,rows];
		  
		    int flow = maxFlow(d,fd,fs,ft,x,y,columns,rows);
		    Console.WriteLine(flow);
		    if(mode==0)return;
		    bool[,] visited = new bool[columns,rows];
		    printReachableSource(d,fd,fs,ft,visited,columns,rows);
	    }
	    
    }
}