#include <bits/stdc++.h>
using namespace std;
int a[5005][5005], vis[5005][5005];
signed main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        int tot = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                for (int k = 0; i + k >= 1 && i + k <= n && j - k >= 1 && j - k <= m; k++)
                    if (!vis[i + k][j - k])
                        a[i + k][j - k] = ++tot, vis[i + k][j - k] = 1;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                cout << a[i][j] << " \n"[j == m], vis[i][j] = 0;
    }
    return 0;
}