#include <bits/stdc++.h>
using namespace std;
const int MaxN = 5e3;
const long long Inf = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const double eps = 1e-7;
template <class T>
inline void read(T &res) {
  char c;
  T flag = 1;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') flag = -1;
  res = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0';
  res *= flag;
}
int t, n;
long long a, b, ans, res, d, D;
long long p[105];
long long cal(int x, int y, long long A, long long B) {
  if (abs(a - b) % abs(x - y)) return Inf;
  if (x > y) {
    swap(x, y);
    swap(A, B);
  }
  p[x] = A;
  p[y] = B;
  d = (B - A) / (y - x);
  for (int i = x - 1; i >= 1; --i) p[i] = p[i + 1] - d;
  for (int i = x + 1; i <= n; ++i) p[i] = p[i - 1] + d;
  for (int i = 1; i <= n; ++i)
    if (p[i] < 1 || p[i] > 1e9) return Inf;
  long long Max = 0;
  for (int i = 1; i <= n; ++i) Max = max(p[i], Max);
  return Max;
}
int main() {
  cin >> t;
  while (t--) {
    cin >> n >> a >> b;
    int pos1 = 0, pos2 = 0;
    ans = Inf;
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        if (i == j) continue;
        res = cal(i, j, a, b);
        if (res < ans) {
          pos1 = i, pos2 = j;
          ans = res;
          D = d;
        }
      }
    }
    p[pos1] = a;
    p[pos2] = b;
    for (int i = pos1 - 1; i >= 1; --i) p[i] = p[i + 1] - D;
    for (int i = pos1 + 1; i <= n; ++i) p[i] = p[i - 1] + D;
    for (int i = 1; i <= n; ++i) printf("%lld%c", p[i], i == n ? '\n' : ' ');
  }
  return 0;
}
