#include <bits/stdc++.h>
using namespace std;
template <typename T>
void input(vector<T> &arr, long long int n) {
  T temp;
  for (long long int i = 0; i < n; i++) cin >> temp, arr.push_back(temp);
}
template <typename T>
void output(vector<T> arr) {
  T temp;
  for (auto x : arr) cout << x << " ";
  cout << endl;
}
template <typename T>
void input_set(set<T> &arr, long long int n) {
  T temp;
  for (long long int i = 0; i < n; i++) cin >> temp, arr.insert(temp);
}
long long int power(long long int num, long long int base) {
  if (base == 0) return 1;
  if (base % 2)
    return (num % 1000000007 * power(num, base - 1) % 1000000007) % 1000000007;
  else {
    long long int x = power(num, base / 2);
    x = (x * x) % 1000000007;
    return x;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int testcases;
  cin >> testcases;
  while (testcases--) {
    long long int x, y, n;
    cin >> n >> x >> y;
    if (x > y) {
      long long int temp = y;
      y = x;
      x = temp;
    }
    long long int D = y - x;
    long long int d = D / (n - 1) + (D % (n - 1) > 0 ? 1 : 0);
    while (D % d > 0) {
      ++d;
    }
    long long int N = 1 + D / d;
    cout << x << " ";
    long long int t = x;
    for (long long int i = 2; i <= N; i++) {
      t = t + d;
      cout << t << " ";
    }
    t = x;
    while (N < n && t - d > 0) {
      t = t - d;
      cout << t << " ";
      N++;
    }
    t = y;
    while (N < n) {
      t = t + d;
      cout << t << " ";
      N++;
    }
    cout << endl;
  }
}
