2차원 배열 max, 행, 열 찾기

package backjoon;
import java.util.*;
public class 연습 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[][] arr = new int[9][9];
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                arr[i][j] = sc.nextInt();
            }
        }
        int max = arr[0][0];
        int maxindex = 0;
        int maxindex2 = 0;
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                if(max <= arr[i][j]){
                    max = arr[i][j];
                    maxindex = i + 1;
                    maxindex2 = j + 1;
                }
            }
        }
        System.out.println(max);
        System.out.println(maxindex + " " + maxindex2);
    }
}