// 2024 IUSB Programming Competition
// Round 1 Problem 5
// Sky Scan
// Solution by Liguo Yu

import java.util.Scanner;

public class round1_p5
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        int m = input.nextInt();  // m row
        int n = input.nextInt();  // n columns
        int r = input.nextInt();  // r double full rounds
        
        int size_full_scan = m*n*2;
        int size_1d = size_full_scan * r;
        
        double[] data = new double[size_1d];
        
        for(int i=0; i<size_1d; i++)
        {
            data[i] = input.nextDouble();
        }
        
        double[][] array = new double[m][n];
                
        for(int i=0; i<m; i++)
        {
            for(int j=0; j<n; j++)
            {
                array[i][j] = 0.0;
                
                for(int k=0; k<r; k++)
                {
                    if(i%2 == 0) 
                    {
                        array[i][j] = array[i][j] + data[k*size_full_scan + i*n + j];
                        array[i][j] = array[i][j] + data[(k+1)*size_full_scan - i*n - j - 1];
                    }
                    else 
                    {
                        array[i][j] = array[i][j] + data[k*size_full_scan + i*n + n-j-1];
                        array[i][j] = array[i][j] + data[(k+1)*size_full_scan - i*n - (n-j)];
                    }
                }
            }
        }
        
        /* for testing
        for (int i = 0; i <m; i++) 
        { 
            for(int j=0; j<n; j++)
            {
                System.out.print(array[i][j] + "\t");
            }
             System.out.println();
        }
        */
        
        double strongest = array[0][0];
        for (int i = 0; i <m; i++) 
        { 
            for(int j=0; j<n; j++)
            {
                if(array[i][j] > strongest)
                    strongest = array[i][j];
            }
        } 
        
        for (int i = 0; i <m; i++) 
        { 
            for(int j=0; j<n; j++)
            {
                if(array[i][j] == strongest)
                    System.out.print("(" + i + ", " + j + ") ");
            }
        }
    }
}