#include <bits/stdc++.h>   using namespace std;   const int mod = 1000000007;   const int LIM = 100005;   long long power(long long x, long long n) {     long long res = 1;     while (n) {       if (n & 1) {         res = res * x % mod;       }       x = x * x % mod;       n >>= 1;     }     return (res % mod);   }   int32_t main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     long long t = 0;     cin >> t;     while (t--) {       long long n = 0, x = 0, y = 0;       cin >> n >> x >> y;       vector<long long> v;       long long dif = y - x;       long long c = n - 1;       long long d = 0;       for (c = n - 1; c >= 1; c--) {         if (dif % c == 0) {           d = dif / c;           break;         }       }       for (long long i = x; i <= y; i += d) {         v.push_back(i);         n--;       }       long long now = x - d;       for (; n > 0;) {         if (now <= 0)           break;         else {           v.push_back(now);           now -= d;           n--;         }       }       now = y + d;       for (; n > 0;) {         if (now <= 0)           break;         else {           v.push_back(now);           now += d;           n--;         }       }       sort(v.begin(), v.end());       for (long long i = 0; i < v.size(); i++) {         cout << v[i] <<    ;       }       cout <<   n ;     }     return 0;   }   