#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 4;
long long solve() {
  long long n, l, r, i;
  cin >> n >> l >> r;
  for (i = l; i <= r; i++) {
    long long p = (-1 + sqrt(1 + 4 * i)) / 2;
    if (i % 2)
      cout << (i - p * (p + 1)) / 2 + (i - p * (p + 1)) % 2 << " ";
    else {
      if (p * (p + 1) == i)
        cout << p + 1 << " ";
      else
        cout << p + 2 << " ";
    }
  }
  cout << "\n\n";
}
signed main() {
  long long t = 1;
  cin >> t;
  while (t--) solve();
}
