#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int G[102][102];

void solve(){
    int H, W;
    cin >> H >> W;
    int a=0, b=H/3*3, c=0, d=W/3*3;

    if (H % 3 == 1) b++;
    if (H % 3 == 2){
        a+=1;
        b+=3;
    }
    if (W % 3 == 1) d++;
    if (W % 3 == 2){
        c+=1;
        d+=3;
    }
    for (int i=a; i<b; i++){
        for (int j=c; j<d; j++) cout << G[i][j] << " ";
        cout << endl;
    }
}

int main(){

    for (int i=0; i<34; i++){
        for (int j=0; j<34; j++){
            G[i*3][j*3] = 0; G[i*3][j*3+1] = 1; G[i*3][j*3+2] = 1;
            G[i*3+1][j*3] = 1; G[i*3+1][j*3+1] = 2; G[i*3+1][j*3+2] = 2;
            G[i*3+2][j*3] = 1; G[i*3+2][j*3+1] = 2; G[i*3+2][j*3+2] = 2;
        }
    }

    int T;
    cin >> T;
    while(T){
        T--;
        solve();
    }

    return 0;
}