using System;


namespace Ice
{
    class Program
    {
	static int addFlow(int[,] c, int [,] f,bool[] visited,int n, int flow, int start){
		    visited[start]=true;
		    int newFlow = 0;
		    if(start == n-1){
			    visited[start]=false;
			    return flow;
		    }
		    //forward:
		    for(int j=0;j<n;j++){
			    if(!visited[j]&&c[start,j]>f[start,j]){
				   newFlow = Math.Min(flow,c[start,j]-f[start,j]);
				   newFlow = addFlow(c,f,visited,n,newFlow, j);
				   if(newFlow==0)continue;
				   f[start,j]+= newFlow;
				   visited[start]=false;
				   return newFlow;
			    }
		    }
		    //backward
		    for(int i=0;i<n;i++){
			    if(!visited[i]&&f[i,start]>0){
				   newFlow = Math.Min(flow,f[i,start]);
				   newFlow = addFlow(c,f,visited,n,newFlow, i);
				   if(newFlow==0)continue;
				   f[i,start]-= newFlow;
				   visited[start]=false;
				   return newFlow;
			    }
		    }
		    visited[start]=false;
		    return 0;
	    }
	    static int maxFlow(int[,] c, int[,] f, int n){
		    bool[] visited = new bool[n];
		    for(int i=0;i<n;i++){
			    visited[i]=false;
		    }
		    while(addFlow(c,f,visited,n,Int32.MaxValue,0)>0){}
		    int sum=0;
		    for(int j=0;j<n;j++)sum+= f[0,j];
		    return sum;
	    }
	    static void printReachable(int[,] c, int[,] f,bool[] visited, int n,int columns, int rows,int start){
		    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]);
			    }
		    }
		    int n = rows*columns+2;
		    int[,] c = new int[n,n];
		    for(int i=1;i<n-1;i++){
			    int x1 = (i-1)%columns;
			    int y1 = (i-1)/columns;
			    for(int j=1;j<n-1;j++){
				    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[,] f = new int[n,n];
		    for(int i=0;i<n;i++){
		    for(int j=0;j<n;j++){
			    f[i,j]=0;
		    }
		    }
		    int flow = maxFlow(c,f,n);
		    Console.WriteLine(flow);
		    if(mode==0)return;
		    bool[] visited = new bool[n];
		    printReachable(c,f,visited,n,columns,rows,0);
	    }
	    
    }
}