#include <bits/stdc++.h>
using namespace std;
void print_vector2d(vector<vector<int>>& a, string name) {
  cout << name << " is\n";
  for (int i = 0; i < a.size(); i++) {
    for (int j = 0; j < a[0].size(); j++) {
      cout << a[i][j] << " ";
    }
    cout << "\n";
  }
  cout << "\n";
}
void print_vector(vector<int>& a, string name) {
  cout << name << " is\n";
  for (int i = 0; i < a.size(); i++) {
    cout << a[i] << " ";
  }
  cout << "\n";
}
void fill_nodes(vector<int>& nodes, int m, long long length_till_now,
                long long l, long long r) {
  for (int i = 1; i < m; i++) {
    if (length_till_now + 1 >= l && length_till_now + 1 <= r)
      nodes.push_back(i);
    if (length_till_now + 2 >= l && length_till_now + 2 <= r)
      nodes.push_back(m);
    length_till_now += 2;
    if (length_till_now >= r) break;
  }
}
int main() {
  int t;
  cin >> t;
  long long n, l, r;
  while (t--) {
    cin >> n >> l >> r;
    long long length_till_now = 0;
    vector<int> nodes;
    for (long long i = 1; i <= n + 1; i++) {
      if (!((length_till_now + 2 * i < l) || (length_till_now > r)))
        fill_nodes(nodes, i + 1, length_till_now, l, r);
      length_till_now += 2 * i;
    }
    for (long long i = l; i <= r; i++) {
      cout << nodes[i - l] << " ";
    }
    cout << "\n";
  }
  return (0);
}
