int task13_2()
{
    int n, m;
    cin >> n >> m;
    int arr[100][100];
    int count = 0;
    for (int j = 0; j < m; j++) {
        int i = 0;
        arr[i][j] = ++count;
        int k = j;
        while (k - 1 >= 0 && i + 1 < n) {
            k--;
            i++;
            arr[i][k] = ++count;
        }
    }
    for (int i = 1; i < n ; i++) {
        int j = m - 1;
        int k = i;
        arr[i][j] = ++count;
        while (j - 1 >= 0 && k + 1 < n) {
            j--;
            k++;
            arr[k][j] = ++count;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cout << setw(4) << arr[i][j];
        }
        cout << endl;
    }
    return 0;
}