#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

void Main() {
  ll T;
  cin >> T;
  while(T--) {
    ll n,m;
    cin >> n >> m;
    if(n==1) {
      if(m==1) pr(0);
      else if(m==2) pr(1,1);
      else pr(-1);
    } else if(m==1) {
      if(n==2) pr(1),pr(1);
      else pr(-1);
    } else if(n==2&&m==2) pr(2,2),pr(2,2);
    else if(n%4==1||n%4==2||m%4==1||m%4==2||n>=8&&m>=4||n>=4&&m>=8) pr(-1);
    else {
      ll a[n][m];
      rep(i,n) {
        rep(j,m) {
          if(i%4<=2&&j%4<=2) {
            a[i][j]=2;
            if(i%4==1&&j%4==1) a[i][j]=0;
          } else if((i+j)%3==0) a[i][j]=0;
          else a[i][j]=1;
        }
      }
      rep(i,n) PR(a[i],m);
    }
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}