#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>

using namespace std;

#define ll long long int 

int main()
{
	int t;
	cin>>t;
	while(t--)
	{	
		ll N;
		cin>>N;
		assert(1 <= N && N <= 100000);
		ll even,odd;
		cin>>even>>odd;
		assert(even + odd == (N*(N+1))/2);
		int temp = -1;
		ll end_odd ;
		for(int i=0 ; i<= N+1 ; i++)
		{
			if(i*(N+1-i) == odd)
			{
				temp = 0 ;
				end_odd = i;
				break;
			}
		}
		if(temp==-1)
		{
			cout<<temp<<endl;
			continue;
		}	
		ll end_even = N+1 - end_odd;
		ll e = 1;
		ll o = 0;
		ll sum_as_of_now = 0;
		for(int i = 0 ; i < N ; i++)
		{
			if(sum_as_of_now % 2 ==0)
			{
				if(e < end_even)
				{
					e++;
					cout<<"0 ";
				}
				else
				{
					o++;
					cout<<"1 ";
					sum_as_of_now++;
				}
			}
			else
			{
				if(e < end_even)
				{
					e++;
					cout<<"1 ";
					sum_as_of_now++;
				}
				else
				{
					o++;
					cout<<"0 ";
				}
			}
		}
		cout<<endl;
	}
	return 0;
}