#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ut unsigned int
#define ss second
#define ff first
#define vi vector<int>
#define vl vector<ll>
#define lb lower_bound
#define up upper_bound
#define re return 
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl

ll inline power(ll a, ll b, ll p){
    a %= p;
    ll ans = 1;
    while(b>0){
        if(b & 1)
            ans = (ans*a)%p;
        a = (a*a)%p;
        b >>= 1;
    }
    return ans;
}

ll inv(ll n, ll p){
    return power(n,p-2, p);
}

bool inline isprime(ll n) {
    if (n <= 1)  return false;
    if (n <= 3)  return true;
    if (n%2 == 0 || n%3 == 0) return false;
    for (ll i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
    return true;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t ;
cin >> t;
while(t--) 
{
  ll n,x,y,i,j,dif=0,ans=0,i1=n,j1=n,k;
  cin>>n>>x>>y;
  vl v,v1;
  ans=y-x;
  dif=ans;
  if(n==2){
  	cout<<x<<" "<<y;
  }
  else{
  for(i=n-1;i>1;i--){
  	if(ans%i==0){
  	dif=ans/i;
  	break;
  	}
  }
  v1.pb(x);
  for(i=1;i<n;i++){
  	if(x+i*dif<=y){
  		v1.pb(x+i*dif);
  	}
  	else{
  	i1=i-1;
  	break;
  	}
  }
  for(j=1;j<n-i1;j++){
  	if(x-j*dif>0){
  		v1.pb(x-j*dif);
  	}
  	else{
  	j1=j-1;
  	break;
  	}
  }
 // cout<<j1<<" ";
  for(k=1;k<n-i1-j1;k++){
  	v1.pb(x+(i-1+k)*dif);
  }
   ll r=v1.size();
   for(i=0;i<n;i++)
   cout<<v1[i]<<" ";
  }
  cout<<endl;
}  
return 0;
}