#include <bits/stdc++.h>
using namespace std;
vector<int> factorize(int n) {
  vector<int> ret;
  for (int i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      ret.push_back(i);
      if (i * i != n) {
        ret.push_back(n / i);
      }
    }
  }
  sort(begin(ret), end(ret));
  return ret;
}
void solve() {
  int n, x, y;
  cin >> n >> x >> y;
  vector<int> factor = factorize(y - x);
  for (int fac : factor) {
    int c = 1;
    int now = y;
    while (c < n) {
      now -= fac;
      ++c;
    }
    if (now > 0 && now <= x) {
      for (int i = 1; i < n; ++i) {
        cout << now << ' ';
        now += fac;
      }
      cout << y << '\n';
      return;
    }
  }
  int lo = 1;
  while (true) {
    int ans = -1;
    for (int fac : factor) {
      if (lo + (n - 1) * fac >= y && (y - lo) % fac == 0) {
        ans = fac;
        break;
      }
    }
    if (ans == -1) {
      ++lo;
      continue;
    }
    for (int i = 0; i < n; ++i) {
      cout << lo << ' ';
      lo += ans;
    }
    cout << '\n';
    return;
  }
  assert(false);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
