#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long int n) {
  long long int c = 0;
  for (long long int i = 1; i <= n; i++) {
    if (n % i == 0) c++;
  }
  if (c == 2)
    return true;
  else
    return false;
}
void solve() {
  long long int n, x, y;
  cin >> n >> x >> y;
  vector<long long int> ans;
  long long int diff = y - x;
  for (long long int i = 1; i <= diff; i++) {
    if (diff % i == 0) {
      long long int numbet = diff / i - 1;
      if (numbet == n - 2) {
        for (long long int j = x; j <= y; j += i) ans.push_back(j);
        break;
      } else if (numbet < n - 2) {
        long long int count = -1;
        long long int blaa = n - numbet - 2;
        long long int orix = x;
        while (x >= 1) {
          ans.push_back(x);
          x -= i;
          count++;
          if (count == blaa) break;
        }
        count++;
        long long int j = orix + i;
        while (count != n) {
          ans.push_back(j);
          j += i;
          count++;
        }
        break;
      }
    }
  }
  for (long long int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
}
int main() {
  long long int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
