#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
void solve() {
  long long n, l, r;
  cin >> n >> l >> r;
  long long p = 0;
  long long s = 1;
  vector<int> bp;
  vector<long long> res;
  int cu = l;
  int a = 1;
  int b = n;
  int c = 1;
  while (a <= b) {
    long long cnt = 2 * (b - a);
    if (p + cnt >= l) {
      vector<long long> list;
      for (int i = a + 1; i <= b; i++) {
        list.push_back(a);
        list.push_back(i);
      }
      while (cu <= r && cu - 1 - p < list.size()) {
        res.push_back(list[cu - 1 - p]);
        cu++;
      }
    }
    if (cu > r) break;
    p += cnt;
    bp.push_back(c);
    if (c == a) {
      a++;
      c = b;
    } else {
      c = b - 1;
      b--;
    }
  }
  long long start = p;
  for (int k : bp) res.push_back(k);
  int sp = 0;
  if (start < l) {
    sp = l - start - 1;
  }
  for (int i = 0; i <= r - l; i++) {
    if (i != 0) cout << " ";
    cout << res[i + sp];
  }
  cout << "\n";
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.precision(10);
  int T = 1;
  cin >> T;
  for (int i = 1; i <= T; i++) {
    solve();
  }
  cout.flush();
  return 0;
}
