#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()


void solve() {
    int n,a,b;
    cin >> n >> a >> b;
    vector<vector<int>> ans(n, vector<int>(n, 0));
    bool ra = a > n/2, rb = b > n/2;
    if(ra) a = n-a;
    if(rb) b = n-b;
    bool sw = a < b;
    if(sw) swap(a, b);

    // 本質
    if(n/2 % 2 == 1 && (a+b) % 2 == 1) {
        cout << -1 << endl;
        return;
    }

    if(b == 0) {
        if(a != 0) {
            cout << -1 << endl;
            return;
        }else {
            // 全て0が答え
        }
    }
    else if(b == 1) {
        if(lcm(n,a) / a % 2 == 1) {
            cout << -1 << endl;
            return;
        }
        vector<int> saw(n, 0);
        int ind = 0;
        rep(i,0,n) {
            if(saw[i] == 0) {
                int nw = i;
                while(saw[nw] == 0) {
                    rep(j,0,a) {
                        ans[ind][(nw+j)%n] = 1;
                    }
                    saw[nw] = saw[(nw+a)%n] = 1;
                    nw = (nw+a*2) % n;
                    ind += 2;
                }
            }
        }
    }
    else {
        if((a+b)%2 == 1) {
            a -= 2;
            b -= 1;
            rep(i,0,n/4) {
                ans[i*4][i*4+1] = 1;
                ans[i*4][i*4+2] = 1;
                ans[i*4+2][i*4+2] = 1;
                ans[i*4+2][i*4+3] = 1;
            }
        }
        rep(i,0,n/2) {
            rep(j,0,b-1) {
                ans[i*2][(i*2+j*2)%n] = 1;
            }
            rep(j,0,a-b+1) {
                ans[i*2][(i*2+(b-1)*2+j)%n] = 1;
            }
        }
    }

    // 出力
    if(sw) {
        rep(i,0,n) {
            rep(j,i+1,n) {
                swap(ans[i][j], ans[j][i]);
            }
        }
    }
    if(ra) {
        rep(i,0,n/2) {
            rep(j,0,n) {
                ans[i*2][j] ^= 1;
            }
        }
    }
    if(rb) {
        rep(i,0,n) {
            rep(j,0,n/2) {
                ans[i][j*2] ^= 1;
            }
        }
    }

    for(auto r: ans) {
        for(auto c: r) cout << c;
        cout << endl;
    }
    return;
}

int main() {
    int t;
    cin >> t;
    while(t--) solve();
}