#include <bits/stdc++.h>
using namespace std;
int T, n, x, y;
int gc(int k) {
  if ((y - x) % (k - 1))
    return -1;
  else
    return (y - x) / (k - 1);
}
int main() {
  cin >> T;
  while (T--) {
    cin >> n >> x >> y;
    int tmp = n, cnt = gc(tmp);
    while (cnt == -1) cnt = gc(--tmp);
    int k = x % cnt;
    if (k > 0) k -= cnt;
    int ans[60];
    for (int i = 1; i <= n; ++i) ans[i] = (k += cnt);
    for (int i = 1; i <= n; ++i) cout << ans[i] + max(0, (y - ans[n])) << ' ';
    cout << endl;
  }
  return 0;
}
