#include <bits/stdc++.h>
using namespace std;
int n, x, y;
void solve() {
  cin >> n >> x >> y;
  pair<int, vector<int>> ans = {INT_MAX, {}};
  for (int i = 0; i < n - 1; i++)
    for (int j = i + 1; j < n; j++) {
      if ((y - x) % (j - i)) continue;
      int dif = (y - x) / (j - i);
      if (x - i * dif <= 0) continue;
      int cur = x - i * dif;
      vector<int> seq = {cur};
      for (int k = 1; k < n; k++) seq.push_back(cur += dif);
      ans = min(ans, {seq.back(), seq});
    }
  for (int i = 0; i < n; i++)
    cout << ans.second[i] << (i == n - 1 ? '\n' : ' ');
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
