#include <bits/stdc++.h>
#pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
using namespace std;
void solve() {
  long long n, first, second;
  cin >> n >> first >> second;
  long long diff = second - first;
  long long ans = n - 1;
  while (1) {
    if (diff % ans == 0) break;
    ans--;
  }
  long long temp = diff / ans;
  vector<long long> v;
  for (long long i = second, j = 1; j <= n; i -= temp, j++) v.emplace_back(i);
  reverse(v.begin(), v.end());
  long long beg = -1;
  for (long long i : v) {
    if (i > 0) {
      beg = i;
      break;
    }
  }
  for (long long i = beg, j = 1; j <= n; ++j, i += temp) cout << i << ' ';
  cout << '\n';
}
int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
