#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long long int INF = 1e18;
const long long int N = 1e6 + 1;
vector<long long int> g[N];
vector<long long int> vis(N);
void solve() {
  long long int n, x, y;
  cin >> n >> x >> y;
  long long int ans = INF;
  long long int first = 0, d = 0;
  for (long long int i = 1; i <= n - 1; i++) {
    for (long long int j = i + 1; j <= n; j++) {
      long long int diff = (y - x);
      if (diff % (j - i) == 0) {
        long long int cd = diff / (j - i);
        long long int a = x - (i - 1) * cd;
        long long int an = a + (n - 1) * cd;
        if (an < ans and a > 0) {
          first = a;
          d = cd;
          ans = an;
        }
      }
    }
  }
  for (long long int i = 1; i <= n; i++) {
    cout << first << ' ';
    first += d;
  }
  cout << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int tc = 1;
  cin >> tc;
  while (tc--) {
    solve();
  }
}
