#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define inf 9223372036854775807
#define mini 9223372036854775807
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
pair<ll,ll>s4[4]={{-1,0},{1,0},{0,-1},{0,1}};
pair<ll,ll>s8[8]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,1},{1,0},{1,-1}};
ll power(ll a,ll b)
{
	if(b==0)
		return 1;
	ll c=power(a,b/2);
	if(b%2==0)
		return ((c%mod)*(c%mod))%mod;
	else
		return ((((c%mod)*(c%mod))%mod)*a)%mod;
}
int main()
{
	boost
	ll t,i;
	cin>>t;
	for(i=0; i<t; i++)
	{
		ll n,l,r;
		cin>>n>>l>>r;
		ll cnt=1;
		ll j=1;
		for(j=1; j<=n; j++)
		{
			ll nxt=cnt+(2*j);
			if(nxt>=l)
				break;
			cnt=nxt;
		}
		j++;
	//	cout<<j<<endl;
		ll chance=0;
		ll cunt=1;
		while(cnt<=r)
		{
			ll val;
			if(chance==0)
			{
				if(cunt>=j)
				{
					cunt=1;
					j++;
				}
				val=cunt;
				cunt++;
			}
			else
				val=j;
			chance=1-chance;
			if(cnt>=l)
				cout<<val<<" ";
			cnt++;
		}
		cout<<endl;
	}
	return 0;
}