#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll _;cin>>_;
  while(_--){
  	ll N,A,B;cin>>N>>A>>B;
  	if(A==0){
  		if(B==0)rep(i,0,N)cout<<string(N,'0')<<endl;
  		else if(B==N)rep(i,0,N){rep(j,0,N)cout<<(char)('0'+j%2);cout<<endl;}
  		else cout<<-1<<endl;
  		continue;
  	}
  	if(A==N){
  		if(B==0)rep(i,0,N)cout<<string(N,'0'+i%2)<<endl;
  		else if(B==N)rep(i,0,N){rep(j,0,N)cout<<(char)('0'+(i+j)%2);cout<<endl;}
  		else cout<<-1<<endl;
  		continue;
  	}
  	if(A%2!=B%2){cout<<-1<<endl;continue;}
  	vector<pl>P,Q;
  	vvl X(2*N+1,vl(2*N+1));
  	{
  		ll g=__gcd(N,2*A);
  		rep(l,0,N/g)rep(k,0,g/2)P.emplace_back(l*2*A+k,l*2*A+A+k);
  	}
  	{
  		ll g=__gcd(N,2*B);
  		rep(l,0,N/g)rep(k,0,g/2)Q.emplace_back(l*2*B+k,l*2*B+B+k);
  	}
  	swap(P,Q);
  	rep(i,0,sz(P)){
  		auto[u,d]=P[i];
  		auto[l,r]=Q[i];
  		l%=N;r%=N;u%=N;d%=N;
  		if(r<l)r+=N;if(d<u)d+=N;
  		X[u][l]++;X[u][r]++;X[d][l]++;X[d][r]++;
  	}
  	rep(i,0,2*N+1)rep(j,0,2*N+1){
  		if(i)X[i][j]+=X[i-1][j];
  		if(j)X[i][j]+=X[i][j-1];
  		if(i&&j)X[i][j]+=X[i-1][j-1];
  		X[i][j]%=2;
  	}
  	vector<string>ans(N,string(N,'0'));
  	rep(i,0,N)rep(j,0,N)ans[i][j]+=(X[i][j]+X[i+N][j]+X[i][j+N]+X[i+N][j+N])%2;
  	rep(i,0,N)cout<<ans[i]<<endl;
  }
  return 0;
}