#include <bits/stdc++.h>
using namespace std;
long long int nr[100005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t;
  cin >> t;
  for (long long int i = 1; i <= 100002; i++) {
    nr[i] = i * (i - 1) + 1;
  }
  while (t--) {
    long long int n, l, r;
    cin >> n >> l >> r;
    long long int g = 0, gt = 0;
    for (long long int i = 1; i <= 100000; i++) {
      if (l >= nr[i] && l < nr[i + 1]) {
        g = i + 1;
        break;
      }
    }
    gt = g;
    vector<long long int> result;
    long long int cnt = nr[g - 1] - 1;
    while (cnt <= r) {
      result.push_back(1);
      cnt++;
      long long int cr = 2;
      for (long long int i = nr[g - 1] + 1; i < nr[g]; i += 1) {
        if ((i - (nr[g - 1] + 1)) % 2 == 0)
          result.push_back(g);
        else
          result.push_back(cr++);
        cnt++;
      }
      g++;
    }
    cnt = nr[gt - 1];
    long long int j = 0;
    while (cnt <= r) {
      if (cnt >= l) cout << result[j] << " ";
      j++;
      cnt++;
    }
    cout << endl;
  }
}
