// #include <format>
#include <climits>
#include <iostream>
#include <fstream>
#include <assert.h>
#include <algorithm>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <map>

# define pb push_back 
#define pii pair<int, int>
#define mp make_pair
# define ll long long int

using namespace std;
  
FILE *fp;
ofstream outfile;

long long readInt(long long l,long long r,char endd){
    long long x=0;
    int cnt=0;
    int fi=-1;
    bool is_neg=false;
    while(true){
        char g=getchar();
        if(g=='-'){
            assert(fi==-1);
            is_neg=true;
            continue;
        }
        if('0'<=g && g<='9'){
            x*=10;
            x+=g-'0';
            if(cnt==0){
                fi=g-'0';
            }
            cnt++;
            assert(fi!=0 || cnt==1);
            assert(fi!=0 || is_neg==false);
            
            assert(!(cnt>19 || ( cnt==19 && fi>1) ));
        } else if(g==endd){
            if(is_neg){
                x= -x;
            }
            assert(l<=x && x<=r);
            return x;
        } else {
            assert(false);
        }
    }
}
string readString(int l,int r,char endd){
    string ret="";
    int cnt=0;
    while(true){
        char g=getchar();
        assert(g != -1);
        if(g==endd){
            break;
        }
        cnt++;
        ret+=g;
    }
    assert(l<=cnt && cnt<=r);
    return ret;
}
long long readIntSp(long long l,long long r){
    return readInt(l,r,' ');
}
long long readIntLn(long long l,long long r){
    return readInt(l,r,'\n');
}
string readStringLn(int l,int r){
    return readString(l,r,'\n');
}
string readStringSp(int l,int r){
    return readString(l,r,' ');
}

const int maxnm = 1e5, maxt = 10;
int main()
{   
    int t = readIntLn(1, maxt);
    int sumnm = 0;
    while(t--){
        int n = readIntSp(1, maxnm), m = readIntLn(1, maxnm / n);
        sumnm += n * m;
        bool trans = false;
        if(n > m){
            swap(n, m); trans = true;
        }
        int ans[n][m];
        for(int i = 0; i < m; i++){
            ans[0][i] = i + 1;
        }
        for(int i = 0; i < m && n > 1; i++){
            ans[1][i] = n + 2 * (i + 1);
        }
        for(int i = 2; i < n; i++){
            for(int j = 0; j < m; j++){
                ans[i][j] = 2 * ans[i - 1][j] - ans[i - 2][j];
            }
        }
        if(trans)swap(n, m);
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(trans)cout << ans[j][i] << " \n"[j == m - 1];
                else cout << ans[i][j] << " \n"[j == m - 1];
            }
        }
    }
    assert(sumnm <= maxnm);
    assert(getchar()==-1);
}