#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using ld = long double;
using pll = pair<ll, ll>;
void buff() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
}
constexpr ll MOD = 1e9 + 7;
inline ll pow_mod(ll a, ll b, ll mod = MOD) {
  ll res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
  }
  return res;
}
int main() {
  buff();
  int t;
  cin >> t;
  for (int i = 0; i < (t); ++i) {
    ll n, l, r;
    cin >> n >> l >> r;
    vector<pair<ll, ll> > c(n);
    ll cur_start = 1;
    ll cur_len = 2;
    for (int j = 1; j < n; ++j) {
      c[j] = make_pair(cur_start, cur_start + cur_len - 1ll);
      cur_start = (cur_start + cur_len);
      cur_len += 2ll;
    }
    c.push_back(make_pair(c.back().second + 1, c.back().second + 1));
    for (int j = 1; j <= n; ++j) {
      if (l > c[j].second) continue;
      if (r < c[j].first) break;
      ll first_good = max(l, c[j].first);
      ll last_good = min(r, c[j].second);
      for (ll x = first_good; x <= last_good; ++x) {
        if (x == c[j].first) {
          cout << 1ll << " ";
        } else {
          ll dist = (x - c[j].first);
          if (dist & 1ll) {
            cout << j + 1ll << " ";
          } else
            cout << (dist / 2ll + 1) << " ";
        }
      }
    }
    cout << '\n';
  }
  return 0;
}
