#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
bool check(vvl g){
	bool ok=true;
	ll h=g.size(),w=g[0].size();
	rep(i,h)rep(j,w){
		ll cnt=0;
		rep(k,4){
			ll nx=i+dx[k],ny=j+dy[k];
			if(nx<0||ny<0||nx>=h||ny>=w)continue;
			if(g[nx][ny]==g[i][j])cnt++;
		}
		if(cnt!=g[i][j])ok=false;
	}
	return ok;
}
int main(){
	vector<vl> g(200,vl(200));
	rep(i,200){
		rep(j,200){
			if(i%3==0&&j%3==0);
			else if(i%3==0||j%3==0)g[i][j]=1;
			else g[i][j]=2;
		}
	}
	ll t;cin >> t;
	while(t--){
		ll h,w;cin >> h >> w;
		vvl ng(h,vl(w));
		bool comp=false;
		rep(p,3){
			rep(q,3){
				rep(i,h){
					rep(j,w){
						ng[i][j]=g[i+p][j+q];
					}
				}
				if(check(ng)){
					comp=true;
					break;
				}
			}
			if(comp)break;
		}
		rep(i,h){
			rep(j,w)cout << ng[i][j] <<" ";
			cout << endl;
		}
	}	
}