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

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int x[200][200];

void init(){
    for(int i = 0; i < 200; i++){
        for(int j = 0; j < 200; j++){
            if(i%3 == 0 && j%3 == 0) x[i][j] = 0;
            else if(i%3 == 0 || j%3 == 0) x[i][j] = 1;
            else x[i][j] = 2;
        }
    }
}

void solve(){
    int h, w; cin >> h >> w;
    int lh = 1, rh = lh+(h/3)*3;
    int lw = 1, rw = lw+(w/3)*3;
    if(h%3 == 1) lh--;
    if(h%3 == 2) rh+=2;
    if(w%3 == 1) lw--;
    if(w%3 == 2) rw+=2;
    for(int i = lh; i < rh; i++){
        for(int j = lw; j < rw; j++){
            cout << x[i][j] << ' ';
        }
        cout << endl;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int t; cin >> t;
    while(t--) solve();
}