#include <bits/stdc++.h>
using namespace std;
int n, a;
char s[100005];
int ans(long long x) {
  if (x == s[a]) return 1;
  int t1 = lower_bound(s + 1, s + n + 1, x) - s;
  int t2 = x - s[t1 - 1];
  if (t2 % 2)
    return t1;
  else
    return t2 / 2 + t1;
}
int main() {
  cin >> n;
  while (n--) {
    long long b, c;
    cin >> a >> b >> c;
    for (int i = 1; i <= a; i++) s[i] = s[i - 1] - 2 * (a - i);
    s[a]++;
    for (long long i = b; i <= c; i++) cout << ans(i) << " ";
    cout << endl;
  }
  return 0;
}
