#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, x, y;
  cin >> n >> x >> y;
  vector<long long> v;
  v.push_back(x);
  v.push_back(y);
  n -= 2;
  long long diff = (y - x);
  long long ok = 0, h, gap = diff;
  for (long long i = 1; i <= diff; i++) {
    if (i == diff) {
      gap = diff;
      break;
    }
    if (diff % i) continue;
    gap = i;
    h = diff / i;
    if (h - 1 == n) {
      ok = 1;
      break;
    } else if (h - 1 < n) {
      ok = 2;
      break;
    }
  }
  if (ok == 1) {
    for (long long i = x + gap; i < y; i += gap) v.push_back(i);
  } else {
    if (ok == 2) {
      for (long long i = x + gap; i < y; i += gap) {
        v.push_back(i);
        n--;
      }
    }
    long long i = x - gap;
    while (i >= 1 && n > 0) {
      v.push_back(i);
      n--;
      i -= gap;
    }
    i = y + gap;
    while (n != 0) {
      v.push_back(i);
      n--;
      i += gap;
    }
  }
  for (auto x : v) cout << x << " ";
  cout << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) solve();
}
