D.cpp

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define inf (1LL << 62)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; i++)
#define for0(i, stop) for(ll i = 0; i < stop; i++)
#define rep1(i, start) for(ll i = start; i >= 1; i--)
#define rep0(i, start) for(ll i = (start-1); i >= 0; i--)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

int main()
{
    ll t;
    cin >> t;
    while(t--) {
        ll n, l, r;
        sl(n), sl(l), sl(r);

        ll prv = 0, f = 0;
        for(ll i = 1; i <= n; i++) {
            ll ase = n-i;
            ll block = ase*2;

            if(block == 0) pf("1");

            if(prv + block < l) {
                prv += block;
                continue;
            }

            ll start = l - prv;
            ll now = start / 2;
            if(start & 1) now++;
            now = i + now;


            if(start & 1) {
                pf("%lld", i);
                start++, l++;
                f = 1;
            }

            bool state = 0;
            ll asi = i;
            //cout << asi << endl;
            for(ll j = l; j <= r; j++) {
                if(f) pf(" ");

                if(!state) {
                    pf("%lld", now);
                    now++;
                    if(now > n)
                        ++asi, now = asi+1;
                }
                else
                    pf("%lld", asi==n? 1 : asi);

                state ^= 1;
                f = 1, start++;
            }

            break;
        }
        pn;
    }

    return 0;
}