T_Algorithm

1
import java.util.Scanner;
2

3
public class Tinkoff {
4
    public static void main(String[] args) {
5
        Scanner input = new Scanner(System.in);
6
        int n = input.nextInt();
7
        int m = input.nextInt();
8
        int[][] grid = new int[n][m];
9
        int num = 11;
10
        for (int i = 0; i < n + m - 1; i++) {
11
            for (int j = 0; j < m; j++) {
12
                int k = i - j;
13
                if (k >= 0 && k < n) {
14
                    grid[k][j] = num++;
15
                }
16
            }
17
        }
18
        for (int i = 0; i < n; i++) {
19
            for (int j = 0; j < m; j++) {
20
                System.out.print(grid[i][j] + " ");
21
            }
22
            System.out.println();
23
        }
24
    }
25
}