int max = -1;
for (int gg1 = 0; gg1 <= g1; gg1++)
    for (int gg2 = 0; gg2 <= g2; gg2++)
                for (int k = 1; k < 150; k++) {
                      int tmp = k * t[n][gg1][gg2][k];
                      max = tmp > max ? tmp : max;
                }

System.out.println(max);