#include <bits/stdc++.h>
using namespace std;
int T, n;
long long int l, r;
map<long long int, long long int> m;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> T;
  while (T--) {
    cin >> n >> l >> r;
    long long int st = (long long int)2 * n - 3;
    long long int sum = st;
    m.clear();
    m.insert({0, 0});
    m.insert({sum, 1});
    long long int la = sum;
    long long int beg = n;
    while (st != 1) {
      st -= 2;
      sum += st;
      la = sum;
      m.insert({sum, beg});
      beg--;
    }
    for (long long int i = l; i <= r; i++) {
      auto it = m.lower_bound(i);
      long long int cal;
      long long int pos = 0;
      if (it != m.end()) {
        auto itit = it;
        advance(itit, -1);
        cal = i - (*(itit)).first;
        pos = (*it).second;
      } else {
        cal = i - la;
        pos = -1;
      }
      if (pos == -1) {
        if (cal + 1 <= n) {
          cout << cal + 1 << " ";
        } else {
          cout << "1 ";
        }
      } else {
        if (cal % 2 == 0) {
          cout << cal / 2 + 1 << " ";
        } else {
          cout << pos << " ";
        }
      }
    }
    cout << "\n";
  }
  return 0;
}
