#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? '\n' : ' ');}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

vector<vector<ll>> solve(ll H, ll W)
{
  vector<vector<ll>> G(H, vector<ll>(W, 2));
  ll y = (H % 3 == 2 ? 2 : 0);
  ll x = (W % 3 == 2 ? 2 : 0);
  for (ll i = 0; i < H; i++)
  {
    for (ll j = 0; j < W; j++)
    {
      G.at(i).at(j) -= (i % 3 == y % 3);
      G.at(i).at(j) -= (j % 3 == x % 3);
    }
  }
  return G;
}

int main()
{
  ll T;
  cin >> T;
  for (ll i = 0; i < T; i++)
  {
    ll H, W;
    cin >> H >> W;

    printvec2(solve(H, W));
  }
}