#include <bits/stdc++.h>
using namespace std;
long long part(long long ind) {
  long long start = 0, last = (long long)1e5;
  long long ret;
  while (start < last) {
    long long mid = (start + last) / 2;
    long long curr = mid * (mid + 1);
    if (curr <= ind) {
      ret = mid;
      start = mid + 1;
    } else
      last = mid;
  }
  return ret;
}
void solve() {
  long long n, l, r;
  cin >> n >> l >> r;
  vector<long long> ans;
  for (long long i = l - 1; i < r; i++) {
    long long p = part(i);
    long long st = p * (p + 1);
    if (i == st)
      ans.push_back(1);
    else if ((i - st) % 2 == 1)
      ans.push_back(p + 2);
    else {
      ans.push_back(((i - st) / (long long)2) + (long long)1);
    }
  }
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  ;
  cin.tie(NULL);
  int zz;
  cin >> zz;
  for (int zzz = 1; zzz <= zz; zzz++) {
    solve();
  }
  return 0;
}
