#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int dp[1000][1000];
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x, y;
    cin >> n >> x >> y;
    vector<pair<int, int>> sol;
    map<pair<int, int>, int> mp;
    int i, j;
    for (i = 0; i <= n - 1; i++) {
      for (j = n - 1; j >= i + 1; j--) {
        int top = y - x;
        int den = j - i;
        if (top % den == 0) {
          int d = top / den;
          pair<int, int> p;
          int a = x - i * d;
          p.first = a;
          p.second = a + (n - 1) * d;
          if (a > 0) {
            sol.push_back(p);
            mp[p] = d;
          }
        }
      }
    }
    int cans = INT_MAX;
    for (i = 0; i < sol.size(); i++) {
      if (sol[i].second < cans) {
        cans = sol[i].second;
      }
    }
    for (i = 0; i < sol.size(); i++) {
      if (sol[i].second == cans) {
        int d1 = mp[{sol[i].first, sol[i].second}];
        for (j = sol[i].first; j <= cans; j += d1) {
          cout << j << " ";
        }
        break;
      }
    }
    cout << endl;
  }
}
