#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n, l, r;
  cin >> n >> l >> r;
  long long int reqn = 1;
  while (l > (1 + reqn * (reqn - 1))) reqn++;
  reqn--;
  long long int stepsdone = 1 + reqn * (reqn - 1);
  long long int currstep = stepsdone;
  long long int whereinnext = l - stepsdone;
  reqn++;
  long long int oddi, even;
  even = reqn;
  long long int totalinreqn = 2 * (reqn - 1);
  if (whereinnext == totalinreqn) {
    oddi = 1;
  } else {
    oddi = whereinnext / 2 + 1;
  }
  currstep = l;
  while (currstep <= r) {
    if (currstep % 2) {
      if (currstep == 1 + (reqn - 1) * reqn)
        cout << 1 << " ";
      else
        cout << oddi << " ";
    } else {
      cout << even << " ";
    }
    if (currstep == 1 + (reqn - 1) * reqn) {
      reqn++;
      even = reqn;
      oddi = 2;
    }
    currstep++;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}
