#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	vector<vector<int>> data(102, vector<int>(102));
	data[0][0] = 0;
	data[0][1] = 1;
	data[0][2] = 1;
	data[1][0] = 1;
	data[1][1] = 2;
	data[1][2] = 2;
	data[2][0] = 1;
	data[2][1] = 2;
	data[2][2] = 2;
	rep(i, 102)rep(j, 102) data[i][j] = data[i % 3][j % 3];
	while (t--) {
		int h, w; cin >> h >> w;
		int sh = 0, sw = 0;
		if (2 == h % 3) sh = 1;
		if (2 == w % 3)sw = 1;
		rep(i, h) {
			rep(j, w) cout << data[i + sh][j + sw] << " ";
			cout << endl;
		}
	}
	return 0;
}