#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, M = 3, nBits = 2e8 + 5, MM = (1 << 16), MAX = 1111,
          OO = 0x3f3f3f3f, MOD = 1000000007, inf = 1 << 30;
const double PI = acos(-1);
const long long INF = (long long)1e18, MOOD = 1000000007;
long long GCD(long long a, long long b) { return !b ? a : GCD(b, a % b); }
long long LCM(long long x, long long y) { return (x * y / GCD(x, y)); }
long long fact(long long z) { return (z <= 1) ? 1 : z * fact(z - 1); }
void fast() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
}
long long t, n, m, a, b, c, x, y, sum, diff, arr1[N], arr2[N], cnt, mn = N,
                                                                    mx = -N;
bool first;
string second, s1, s2, s3;
vector<int> v;
int main() {
  cin >> t;
  while (t--) {
    v.clear();
    cin >> n >> x >> y;
    for (int i = 1; i <= 50; ++i) {
      if ((y - x) % i == 0 && (y - x) / i < n) {
        for (int j = max(y - (n - 1) * i, (y - 1) % i + 1), st = 1; st <= n;
             j += i, ++st)
          cout << j << " ";
        cout << endl;
        break;
      }
    }
  }
  return 0;
}
