#include <bits/stdc++.h>
using namespace std;
void comp() {
  long long i, j, k, l, m, n, r;
  cin >> n >> l >> r;
  vector<long long> v1(n + 1);
  v1[0] = 0;
  v1[1] = 2 * (n - 1);
  for (i = 2; i < n; i++) {
    v1[i] = v1[i - 1] + 2 * (n - i);
  }
  long long low = 0;
  long long high = n - 1;
  long long mid, temp;
  vector<long long> ans;
  for (i = l; i < r + 1; i++) {
    low = 1;
    high = n - 1;
    temp = 1;
    while (low <= high) {
      mid = (low + high) / 2;
      if (v1[mid] >= i) {
        temp = mid;
        high = mid - 1;
      } else {
        low = mid + 1;
      }
    }
    if (i % 2)
      ans.push_back(temp);
    else {
      j = i;
      j -= v1[mid - 1];
      j /= 2;
      ans.push_back(temp + j);
    }
  }
  for (i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0);
  long long i = 0, t;
  cin >> t;
  while (t--) {
    comp();
  }
  return 0;
}
