#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x, y;
    cin >> n >> x >> y;
    int diff = y - x;
    int ad = -1;
    for (int i = n - 1; i >= 1; i--) {
      if ((diff % i) == 0) {
        ad = diff / i;
        break;
      }
    }
    vector<int> B;
    int b = x;
    while (b <= y) {
      B.push_back(b);
      b += ad;
    }
    int d = x;
    while (B.size() != n and d - ad >= 1) {
      d -= ad;
      B.push_back(d);
    }
    while (B.size() != n) {
      y += ad;
      B.push_back(y);
    }
    sort(B.begin(), B.end());
    for (int i = 0; i < B.size(); i++) {
      cout << B[i] << " ";
    }
    cout << endl;
  }
}
