import java.util.Scanner;

 public class Solution
 {
     public static void main(String[] args)
     {
         Scanner input = new Scanner(System.in);
         System.out.print("Enter the number of rows and columns of the array: ");
         int row = input.nextInt();
         int column = input.nextInt();

         double[][] array = new double[row][column];

         System.out.println("Enter the array: ");
         for(int i = 0; i < row; i++)
             for(int j = 0; j < column; j++)
                 array[i][j] = input.nextInt();

         int[] maxElement = locateLargest(array);
         System.out.println("The location of the largest element is at (" + maxElement[0] + ", " + maxElement[1] + ")");
     }

     public static int[] locateLargest(double[][] a)
     {
         int[] maxLocation = new int[2];
         double maxValue = a[0][0];

         for(int i = 0; i < a.length; i++)
             for(int j = 0; j < a[0].length; j++)
                 if(a[i][j] > maxValue)
                 {
                     maxValue = a[i][j];
                     maxLocation[0] = i;
                     maxLocation[1] = j;
                 }

         return maxLocation;
     }
 }