#include <bits/stdc++.h>
using namespace std;
long long int vmax(vector<long long int> &v) {
  return (*max_element(v.begin(), v.end()));
}
long long int vmin(vector<long long int> &v) {
  return (*min_element(v.begin(), v.end()));
}
long long int power_mod_m(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = ((res % p) * (x % p)) % p;
    y = y >> 1;
    x = ((x % p) * (x % p)) % p;
  }
  return res;
}
long long int inverse_mod(long long int x, long long int mod) {
  return (power_mod_m(x, mod - 2, mod));
}
void solve() {
  long long int n, l, r;
  cin >> n >> l >> r;
  if (r == l && r - 1 == (n * (n - 1))) {
    cout << 1 << "\n";
    return;
  }
  long long int is_present = 0;
  if (r - 1 == (n * (n - 1))) {
    is_present = 1;
    r--;
  }
  long long int sum = (n - 1) * 2;
  vector<long long int> v;
  while (sum != 0) {
    v.push_back(sum);
    sum = sum - 2;
  }
  for (int j = 1; j < v.size(); j += 1) {
    v[j] = v[j - 1] + v[j];
  }
  long long int i = lower_bound(v.begin(), v.end(), l) - v.begin();
  long long int element_prev = 0;
  if (i >= 1) {
    element_prev = v[i - 1];
  }
  if (l - element_prev % 2 != 0) {
    long long int add = (l - element_prev + 1) / 2;
    long long int start = i + 1;
    add = add + start;
    if (l == r) {
      cout << start << "\n";
      return;
    } else {
      cout << start << " " << add << " ";
      long long int cnt = 2;
      long long int x = start;
      long long int in = 1;
      while (cnt < r - l + 1) {
        add++;
        if (add == n + 1) {
          start = x + in;
          in++;
          add = start + 1;
        }
        cout << start << " ";
        cnt++;
        if (cnt < r - l + 1) {
          cout << add << " ";
          cnt++;
        } else {
          break;
        }
      }
    }
  } else {
    long long int start = i + 1;
    long long int add = (l - element_prev) / 2;
    add = add + start;
    if (l == r) {
      cout << add << "\n";
    } else {
      long long int cnt = 1;
      long long int x = start;
      long long int in = 1;
      while (cnt < r - l + 1) {
        cout << add << " ";
        cnt++;
        if (cnt < r - l + 1) {
          add++;
          if (add == n + 1) {
            start = x + in;
            in++;
            add = start + 1;
          }
          cout << start << " ";
          cnt++;
        } else {
          break;
        }
      }
    }
  }
  if (is_present == 1) {
    cout << 1 << "\n";
    return;
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  mt19937 rand(chrono::steady_clock::now().time_since_epoch().count());
  long long int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
