#include <bits/stdc++.h>
#define lli long long

using namespace std;

int a[100005];

int main()
{
	int t, n;
	lli even, odd, odd_prefix_sums, even_prefix_sums, tot_sub_arrays;
	
	cin >> t;
	assert(t >= 1 && t <= 10);
	
	while ( t-- ) {
		
		cin >> n >> even >> odd;
		assert(n >= 1 && n <= 20);
		
		tot_sub_arrays = ((lli)n*(lli)(n + 1LL))/2;
		
		assert(even >= 0 && even <= tot_sub_arrays);
		assert(odd >= 0 && odd <= tot_sub_arrays);
		assert(odd + even == tot_sub_arrays);
		
		for ( int i = 0; i < (1<<n); i++ ) {
			a[0] = 0;
			int even_now = 0, odd_now = 0;
			for ( int j = 0; j < n; j++ ) {
				if ( i & (1<<j) ) a[j + 1] = 1;
				else a[j + 1] = 0;
			}
			
			for ( int j = 1; j <= n; j++ ) {
				int sum = 0;
				for ( int k = j; k <= n; k++ ) {
					sum += a[k], sum %= 2;
					if ( sum ) odd_now++;
					else even_now++;
				}
			}
			if ( even_now == even && odd_now == odd ) {
				for ( int j = 1; j <= n; j++ ) cout << a[j] << " ";
				cout << endl;
				goto p;
			}
		}
		cout << "-1" << endl;
		p: { }
		
	}
	
	return 0;
}