include[HTML_REMOVED]

using namespace std;
long long n,k,m;
int T;
int cnt=0;
bool check(){
cnt=0;
while(m){
cnt;
m/=2;
}
return k>=(1<[HTML_REMOVED]>T;
while(T–){
cin>>n>>k>>m;
long long p=m;
if(check()){
puts(“-1”);
continue;
}
if(k==0){
for(int i=1;i<=n;i) cout<<0<<” “;
continue;
}
if(k<=p){
if(n%2==0){
for(int i=1;i<=n-1;i) cout<<0<<” “;
cout<<k<<endl;
}
else {
for(int i=1;i<=n-1;i) cout<<0<<” “;
cout<<k<<endl;
}
}
else{
if(n%2==0){
for(int i=1;i<=n-2;i) cout<<0<<” “;
cout<<(1ll<<cnt-1)<<” “<<k-(1ll<<cnt-1)<<endl;
}
else{
for(int i=1;i<=n-3;i) cout<<0<<” “;
long long q=k-(1<<cnt-1);
cout<<(1ll<<cnt-1)<<” “<<q-lowbit(q)<<” “<<lowbit(q)<<endl;
}
}
}
}