#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}} #define dame { cout << "No" << endl; return 0;} #define dame1 { cout << -1 << endl; return 0;} #define test(x) cout << "test" << x << endl; #define deb(x,y) cout << x << " " << y << endl; #define deb3(x,y,z) cout << x << " " << y << " " << z << endl; #define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl; #define out cout << ans << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define show(x) cerr<<#x<<" = "<; using pil = pair; using pli = pair; using pii = pair; using tp = tuple; using vi = vector; using vl = vector; using vs = vector; using vb = vector; using vpii = vector; using vpli = vector; using vpll = vector; using vpil = vector; using vvi = vector>; using vvl = vector>; using vvs = vector>; using vvb = vector>; using vvpii = vector>; using vvpli = vector>; using vvpll = vector; using vvpil = vector; using mint = modint998244353; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; int main(){ int t; cin>>t; vector ans(t); auto one_zero = [&](int ai , int l , int hi,int stnow)->void{ int now = stnow; if (hi%3 == 1){ ans[ai][now++][l] = 0; } while(now < hi+stnow){ ans[ai][now++][l] = 1; ans[ai][now++][l] = 1; if (now == hi+stnow) break; ans[ai][now++][l] = 0; } return; }; vi tr(t); rep(i,t){ int h,w; cin>>h>>w; if (h == 1){ if (w == 1){ ans[i].resize(1 , vi(1)); continue; } tr[i] = 1; swap(h , w); // ans[i].resize(h , vi(w)); // one_zero(i , 0 , h , 0); // continue; } if (h == 2){ if (w == 2){ ans[i].resize(2 , vi(2,2)); continue; } tr[i] = 1; swap(h , w); } ans[i].resize(h , vi(w)); int nowl = 0; bool ok = false; if (w%4 == 1){ one_zero(i , 0 , h , 0); nowl++; } if (w%4 == 2){ // rep(j,2) rep(k,h) ans[i][k][w-1-j] = 2; ok = true; w -= 2; } while(nowl < w){ repx(j,nowl,nowl+3){ rep(k,h) ans[i][k][j] = 2; } one_zero(i , nowl+1 , h-2 , 1); nowl += 3; if (nowl == w) break; one_zero(i , nowl , h , 0); nowl++; } if (ok){ one_zero(i , w , h , 0); one_zero(i , w+1 , h , 0); repx(j,w,w+2) rep(k,h) ans[i][k][j]++; } } rep(i,t){ if (tr[i] == 1){ rep(j,sz(ans[i][0])){ rep(k,sz(ans[i])) cout << ans[i][k][j] << " "; cout << endl; } }else{ rep(j,sz(ans[i])){ rep(k,sz(ans[i][0])) cout << ans[i][j][k] << " "; cout << endl; } } } return 0; }