#include <bits/stdc++.h>
using namespace std;
long long t, k, x, y, arr[55];
void print() {
  long long i;
  for (i = 1; i <= k; ++i) {
    cout << arr[i] << " ";
  }
  cout << endl;
}
void solve() {
  long long a, i, j, n;
  n = k;
  a = y - x;
  n -= 2;
  arr[1] = x;
  arr[k] = y;
  j = 1;
  for (i = 1; i <= a; ++i) {
    if (a % i == 0) {
      if (x + n * i >= y - i) {
        while (arr[j] + i < y) {
          j++;
          arr[j] = arr[j - 1] + i;
          n--;
        }
        while (x > 0 && n > 0) {
          x -= i;
          if (x > 0) {
            j++;
            arr[j] = x;
            n--;
          }
        }
        while (n > 0) {
          y += i;
          j++;
          arr[j] = y;
          n--;
        }
        break;
      }
    }
  }
}
void nhap() { cin >> k >> x >> y; }
int main() {
  long long i;
  cin >> t;
  for (i = 1; i <= t; ++i) {
    nhap();
    solve();
    print();
  }
  return 0;
}
