//goo.gl/yJo5dx
{
    int n, m;
    cin >> n >> m;
    int arr[100][100];
    int count = 0;
    int i1 = 0;
    for (int j = 0; j < m + n - 1; j++) {
        if (j < m) {
            int i = 0;
            arr[i][j] = ++count;
            int k = j;
            while (k - 1 >= 0 && i + 1 < n) {
                k--;
                i++;
                arr[i][k] = ++count;
            }
        }
        else {
            ++i1;
            int i = i1;
            int k = m - 1;
            arr[i1][k] = ++count;
            while (k - 1 >= 0 && i + 1 < n) {
                k--;
                i++;
                arr[i][k] = ++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;
}