/*

  "With age, comes wisdom. With travel, comes understanding.
   Remember that happiness is a way of travel – not a destination"

*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define int            long long int
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define double         long double
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " "; cout << endl
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl

inline int power(int a, int b)
{
     int x = 1;
     while (b)
     {
          if (b & 1) x *= a;
          a *= a;
          b >>= 1;
     }
     return x;
}

typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> Set;

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
     const char* comma = strchr (names + 1, ',');
     cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}

const int N = 100005;
int n, m, l, r;

void work(int pos, int x, int tot)
{
     int req = r - tot + 1, tt = r - l + 1;
     // bug(tot, l);
     vi v;
     for (int i = pos; i <= n; i++)
     {
          if (i == n)
               v.pb(1);
          else
          {
               int y = i;
               for (int j = 0; j < x; j++)
               {
                    if (j & 1)
                    {
                         y++;
                         v.pb(y);
                         req--;
                    }
                    else
                    {
                         v.pb(i);
                         req--;
                    }
                    if (!req)
                         break;
               }
          }
          if (!req)
               break;
     }
     // print(v);
     for (int i = l - tot - 1; i < sz(v); i++)
     {
          cout << v[i] << " ";
          tt--;
          if (!tt)
               break;
     }

     cout << endl;

}

void solve()
{
     cin >> n >> l >> r;

     int tot = 0, x = 2 * (n - 1);
     for (int i = 1; i <= n; i++)
     {
          if (tot + x >= l)
          {
               work(i, x, tot);
               break;
          }
          tot += x;
          x -= 2;
          if (!x)
               x = 1;
     }

}

int32_t main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

#ifndef ONLINE_JUDGE
     freopen("input.txt",  "r",  stdin);
     freopen("output.txt", "w", stdout);
#endif

     cout << setprecision(9) << fixed;
     clock_t z = clock();

     int t; cin >> t;
     while (t--) solve();

     cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

     return 0;
}