#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n, x, y;
    cin >> n >> x >> y;
    long long val;
    for (int i = n - 1; i >= 1; i--) {
      if (abs(y - x) % i == 0) {
        val = (y - x) / i;
        break;
      }
    }
    vector<int> v;
    for (int i = x; i <= y; i += val) {
      v.push_back(i);
    }
    if (v.size() == n) {
      for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
      cout << '\n';
    } else {
      long long m = n - v.size();
      while (m--) {
        if ((v[0] - val) > 0)
          v.insert(v.begin(), v[0] - val);
        else
          v.push_back(v[v.size() - 1] + val);
      }
      for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
      cout << '\n';
    }
  }
}
