public static Long getMaxDiagonal2Product(int[][] data, int numbers) {
        int max = Integer.MIN_VALUE;
        for (int x = 0; x + numbers <= DATA.length; x++) {
            for (int y = 0; y + numbers <= DATA.length; y++) {
                int sum = 1;
                for (int offset = 0; offset < numbers; offset++) {
                    sum *= data[x + offset][y + offset];
                }
                max = Math.max(max, sum);
            }
        }
        return (long) max;
    }