#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using Pll_ll = pair<ll, ll>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const ll LINF = 1000000000000000000;
const double EPS = 1E-10;
template <class T, class S>
bool chmax(T &a, const S &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T, class S>
bool chmin(T &a, const S &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  int T, n;
  cin >> T;
  bool space(false);
  ll l, r, gp(-1);
  for (int t = (0), t_len = (T); t < t_len; ++t) {
    cin >> n >> l >> r;
    gp = -1;
    space = false;
    for (ll i = (l), i_len = (r); i <= i_len; ++i) {
      if (space)
        cout << " ";
      else
        space = true;
      if (i == 1) {
        cout << 1;
        space = true;
        continue;
      }
      if (i == 2) {
        gp = 2;
        cout << 2;
        continue;
      }
      if (gp == -1) {
        ll j(max(2, int(sqrt(i) - 4)));
        for (; 2 + (j - 2) * (j - 1) < i; ++j)
          ;
        gp = j;
      } else {
        if (2 + (gp - 1) * gp <= i) ++gp;
      }
      if (!((i - 2 + (gp - 2) * (gp - 1)) % 2))
        cout << gp;
      else {
        ll j((i - (2 + (gp - 2) * (gp - 1)) + 1) / 2 + 1);
        cout << ((j != gp) ? j : 1);
      }
    }
    cout << "\n";
  }
  return 0;
}
