#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    unordered_set<int> s;
    int n, x, y;
    scanf("%d%d%d", &n, &x, &y);
    int sel = y - x, tmp = n;
    while (sel % (tmp - 1) != 0) tmp--;
    int beda = sel / (tmp - 1);
    for (int i = x; i <= y; i += beda) {
      s.insert(i);
    }
    n -= sel / beda + 1;
    x -= beda;
    y += beda;
    while (n > 0 && x > 0) {
      s.insert(x);
      n--;
      x -= beda;
    }
    while (n > 0) {
      s.insert(y);
      y += beda;
      n--;
    }
    int idx = 0;
    for (auto i : s) {
      idx++;
      printf("%d", i);
      if (idx == s.size())
        printf("\n");
      else
        printf(" ");
    }
  }
}
