#include <bits/stdc++.h>
using namespace std;
bool prime(long long int x) {
  long long int p = 0;
  for (long long int i = 2; (i * i <= x && p == 0); i++) {
    if (x % i == 0) p++;
  }
  return (p == 0);
}
int main() {
  long long int t, n, x, y;
  cin >> t;
  while (t--) {
    cin >> n >> x >> y;
    long long int diff = y - x, tmp = n - 1, tmpy = y, tmpx = x;
    while (diff % tmp != 0) tmp--;
    diff = diff / tmp;
    vector<long long int> v;
    if (n == 2) {
      v.push_back(x);
      v.push_back(y);
    } else if (tmp == n - 1) {
      v.push_back(x);
      v.push_back(y);
      n = n - 2;
      while (n--) {
        x = x + diff;
        v.push_back(x);
      }
    } else {
      v.push_back(x);
      v.push_back(y);
      n = n - 2;
      while (n > 0 && x + diff < y) {
        x = x + diff;
        v.push_back(x);
        n--;
      }
      x = tmpx;
      while (n > 0 && x - diff > 0) {
        x = x - diff;
        v.push_back(x);
        n--;
      }
      while (n > 0) {
        y = y + diff;
        v.push_back(y);
        n--;
      }
    }
    for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
    cout << endl;
  }
  return 0;
}
