#include <bits/stdc++.h>
using namespace std;
long long t, n, st, dr, st1, dr1, ok, sum[100005], pereche, sol[100005], sol2,
    i, poz, q;
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  cin >> t;
  for (; t--;) {
    cin >> n >> st1 >> dr1;
    ok = 0;
    if (dr1 == n * (n - 1) + 1) {
      dr1--;
      ok = 1;
    }
    pereche = st1 / 2 + st1 % 2;
    sol2 = 0;
    for (i = 1; i <= n - 1; i++) {
      sum[i] = sum[i - 1] + n - i;
    }
    for (i = 1; i <= n - 1; i++) {
      if (pereche <= sum[i]) {
        sol2 = i - 1;
        break;
      }
    }
    poz = sol2 + 1;
    q = 0;
    memset(sol, 0, sizeof(sol));
    for (i = st1; i <= dr1; i++) {
      pereche = i / 2 + i % 2;
      if (pereche == sum[poz + 1]) {
        poz++;
      }
      if (i % 2 == 0) {
        sol[++q] = poz + pereche - sum[poz - 1];
      } else {
        sol[++q] = poz;
      }
    }
    if (ok == 1) {
      sol[++q] = 1;
    }
    for (i = 1; i <= q; i++) {
      cout << sol[i] << " ";
    }
    cout << '\n';
  }
  return 0;
}
