#include <bits/stdc++.h>
using namespace std;
void FAST() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long int power(long long int num, long long int r) {
  if (r == 0) return 1;
  if (r == 1) return num % 1000000007;
  long long int ans = power(num, r / 2) % 1000000007;
  if (r % 2 == 0) {
    return (ans * ans) % 1000000007;
  }
  return (((ans * ans) % 1000000007) * num) % 1000000007;
}
long long int modinv(long long int num) { return power(num, 1000000007 - 2); }
long long int nCr(long long int n, long long int r) {
  if (r == 0 || r == n) return 1;
  long long int fac[n + 1];
  fac[0] = 1;
  for (long long int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % 1000000007;
  long long int ans = ((fac[n] * modinv(fac[r])) % 1000000007);
  ans *= (modinv(fac[n - r]) % 1000000007);
  ans %= 1000000007;
  return ans;
}
class Triplet {
 public:
  long long int gcd;
  long long int x;
  long long int y;
};
Triplet gcdExtEuclid(long long int a, long long int b) {
  if (b == 0) {
    Triplet myAns;
    myAns.gcd = a;
    myAns.x = 1;
    myAns.y = 0;
    return myAns;
  }
  Triplet smaintAns = gcdExtEuclid(b, a % b);
  Triplet myAns;
  myAns.gcd = smaintAns.gcd;
  myAns.x = smaintAns.y;
  myAns.y = (smaintAns.x - ((a / b) * (smaintAns.y)));
  return myAns;
}
long long int gcd(long long int a, long long int b) {
  if (a < b) {
    return gcd(b, a);
  }
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long int modinvM(long long int A, long long int M) {
  Triplet ans = gcdExtEuclid(A, M);
  return ans.x;
}
bool* makeSieve(long long int n) {
  bool* isPrime = new bool[n + 1];
  for (long long int i = 0; i <= n; i++) {
    isPrime[i] = true;
  }
  isPrime[0] = false;
  isPrime[1] = false;
  for (long long int i = 2; i * i <= n; i++) {
    for (long long int j = i * i; j <= n; j += i) {
      isPrime[j] = false;
    }
  }
  return isPrime;
}
map<long long int, long long int> factorize(long long int n) {
  map<long long int, long long int> ans;
  bool* isPrime = makeSieve((long long int)sqrt(n));
  for (long long int i = 2; i * i <= n; i++) {
    if (isPrime[i] == true) {
      while (n % i == 0) {
        ans[i]++;
        n /= i;
      }
    }
  }
  delete[] isPrime;
  if (n > 1) {
    ans[n]++;
    n = 1;
  }
  return ans;
}
int32_t main() {
  FAST();
  long long int tc;
  cin >> tc;
  while (tc--) {
    long long int n, x, y, l = 0, r = 0;
    cin >> n >> x >> y;
    long long int arr[n];
    long long int i, diff = y - x, ap_diff, cnt = 2;
    for (i = n - 1; i >= 1; i--) {
      if (i <= diff && (diff % i == 0)) {
        ap_diff = diff / i;
        cnt += i - 1;
        goto here;
      }
    }
  here:
    if (cnt != n) {
      if (x > ap_diff) {
        if ((x / ap_diff) > (n - cnt)) {
          l += (n - cnt);
          cnt += l;
        } else {
          if (x % ap_diff > 0) {
            l += (x / ap_diff);
            cnt += l;
          } else {
            l += (x / ap_diff) - 1;
            cnt += l;
          }
        }
      }
      if (cnt != n) {
        r += (n - cnt);
        cnt += r;
      }
    }
    long long int start = x - (l * ap_diff);
    arr[0] = start;
    cout << arr[0] << " ";
    for (i = 1; i < n; i++) {
      arr[i] = arr[i - 1] + ap_diff;
      cout << arr[i] << " ";
    }
    cout << '\n';
  }
  return 0;
}
