#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
void fn(long long int a[], long long int a1, long long int b, long long int n) {
  for (long long int i = 0; i < n; i++) {
    a[i] = a1;
    a1 += b;
  }
}
void solve() {
  long long int n, x, y;
  cin >> n >> x >> y;
  long long int bst = INT_MAX;
  long long int a[n];
  for (long long int i = 1; i < 51; i++) {
    for (long long int j = 1; j < 51; j++) {
      long long int x1 = 0, y1 = 0;
      long long int a1[n];
      fn(a1, i, j, n);
      for (long long int i = 0; i < n; i++) {
        if (a1[i] == x) {
          x1 = 1;
        }
        if (a1[i] == y) {
          y1 = 1;
        }
      }
      if (x1 and y1 and a1[n - 1] < bst) {
        for (long long int i = 0; i < n; i++) {
          a[i] = a1[i];
        }
        bst = a[n - 1];
      }
    }
  }
  for (long long int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
