#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using pcc = pair<char, char>;
using pdd = pair<double, double>;
template <typename T>
inline T Set(T &n, T p) {
  T on = 1;
  return n = n | (on << p);
}
template <typename T>
inline T Reset(T &n, T p) {
  T on = 1;
  return n = n & (~(on << p));
}
template <typename T>
inline bool Check(T n, T p) {
  T on = 1;
  return (bool)(n & (on << p));
}
template <typename T>
inline T Toggle(T &n, T p) {
  T on = 1;
  return n = n ^ (on << p);
}
template <typename T>
T POW(T a, T b) {
  T x = 1;
  while (b) {
    if (b & 1) x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}
template <typename T>
T mPOW(T a, T b, T M) {
  T x = 1;
  while (b) {
    if (b & 1) x = (x * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return x;
}
template <typename T>
T Sqrt(T a) {
  T x = (T)sqrt(a);
  if ((x + 1) * (x + 1) == a) x++;
  return x;
}
int main(int argc, char *argv[]) {
  int testcase, cs = 1;
  cin >> testcase;
  while (testcase--) {
    int n, x, y;
    scanf("%d%*c%d%*c%d%*c", &(n), &(x), &(y));
    int df = y - x;
    if (df % (n - 1) == 0) {
      df = df / (n - 1);
      for (int i = 0; i < n; i++) {
        printf("%d", (x + i * df));
        printf(" ");
      }
      printf("\n");
    } else {
      for (int i = 1; i <= df; i++) {
        if (df % i == 0) {
          if (df / i < n) {
            n -= df / i + 1;
            df = i;
            break;
          }
        }
      }
      for (int i = x; i <= y; i += df) {
        printf("%d", (i));
        printf(" ");
      }
      for (int i = x - df; n && i > 0; i -= df) {
        printf("%d", (i));
        printf(" ");
        n--;
      }
      for (int i = y + df; n; i += df) {
        printf("%d", (i));
        printf(" ");
        n--;
      }
      printf("\n");
    }
  }
  return 0;
}
