#include <bits/stdc++.h>
using namespace std;
int T, n, x, y;
vector<int> res;
void solve() {
  res.clear();
  scanf("%d%d%d", &n, &x, &y);
  for (int i = 1; i <= y - x; i++) {
    if (0 != (y - x) % i) continue;
    if ((y - x) / i + 1 > n) continue;
    int cnt = 0;
    for (int j = x; j <= y && cnt < n; j += i, cnt++) res.push_back(j);
    for (int j = x - i; j > 0 && cnt < n; j -= i, cnt++) res.push_back(j);
    for (int j = y + i; cnt < n; j += i, cnt++) res.push_back(j);
    break;
  }
  for (int i = 0; i < res.size(); i++) {
    printf("%d", res[i]);
    printf(i == res.size() - 1 ? "\n" : " ");
  }
}
int main() {
  scanf("%d", &T);
  while (T--) solve();
  return 0;
}
