{
    int n, m;
    cin >> n >> m;
    int count = 0;
    int p = 0;
    //for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int count1;
            int k = j;
            int k1 = 0;
            if (k == 0 || k - 1 == 0) {
                cout << setw(4) << ++count;
            }
            else if (k - 1 > 0 && k1 < n) {
                while (k - 1 >= 0) {
                    k--;
                    k1++;
                    p++;
                }
                count1 = count + p;
                cout << setw(4) << count1;
            }
        }
    //}
    return 0;
}