import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.Scanner; 
import java.util.StringTokenizer; 
import java.util.*;
import java.io.*;
public class codeforces 
{ 
   static class Student{
       int x,y,z;
        Student(int x,int y,int z){
            this.x=x;
            this.y=y;
            this.z=z;
        }
    }
    static int prime[];
    static void sieveOfEratosthenes(int n) 
    { 
        // Create a boolean array "prime[0..n]" and initialize 
        // all entries it as true. A value in prime[i] will 
        // finally be false if i is Not a prime, else true. 
        int pos=0;
        prime= new int[n+1]; 
        for(int p = 2; p*p <=n; p++) 
        { 
            // If prime[p] is not changed, then it is a prime 
            if(prime[p] == 0)
            { 
                // Update all multiples of p
                prime[p]=p;
                for(int i = p*p; i <= n; i += p) 
                    prime[i] = p; 
            } 
        } 
    }
static    class Sortbyroll implements Comparator<Student> 
{ 
    // Used for sorting in ascending order of 
    // roll number 
    public int compare(Student c, Student b) 
    { 
        return (b.y-b.z)-(c.y-c.z);
    } 
} 
static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
 
    static class Edge{
        int a,b;
        Edge(int a,int b){
            this.a=a;
            this.b=b;
        }
    }
    static class Trie{
        Trie z,o;
       // int c;
        Trie(){
            z=null;
            o=null;
            //c=0;
        }
    }
    //static long ans;
    static int parent[];
    static int rank[];
    static int b[][];
    static int bo[];
    static int ho[];
    static int seg[];
    //static int pos;
   // static long mod=1000000007;
    //static int dp[][];
    static HashMap<Integer,Integer>map;
    static PriorityQueue<Student>q=new PriorityQueue<>();
    //static Stack<Integer>st;
   // static ArrayList<Character>ans;
    static ArrayList<ArrayList<Integer>>adj;
    //static int ans;
    static Trie root;
    static long fac[];
    static long mod=(long)(998244353);
    static void solve()throws IOException{
        FastReader sc=new FastReader();
        int t,i,n,j,c,li;
        long l,r,p,sum,t1;
        t=sc.nextInt();
        while(t>0){
            sum=0;
            p=1;
            n=sc.nextInt();
            l=sc.nextLong();
            r=sc.nextLong();
            sum=1;
            li=1;
            for(i=2;i<=n;i++){
                sum+=(long)(2*i-2);
                if(sum<=l){
                    p=sum;
                    li=i+1;
                }
                if(sum>=r)
                    break;
            }
            //p=sum-(long)(2*i-2);
            Queue<Integer>q=new LinkedList<>();
            q.add(1);
            t1=p;
            //p+=(long)1;
            j=2;
            c=0;
            while(p<sum){
                j=2;
                c=0;
                for(int x=1;x<=2*li-3;x++){
                    if(c%2==0)
                        q.add(li);
                    else{
                        q.add(j);
                        ++j;
                    }
                    c=1-c;
                }
                if(li!=1)
                q.add(1);
                p+=(long)(2*li-2);
                ++li;
            }
            //q.add(1);
            p=t1;
            while(p<l){
                q.poll();
                p+=(long)1;
            }
            StringBuilder sb=new StringBuilder();
            while(p<=r){
                sb.append(q.poll()+" ");
                p+=(long)1;
            }
            System.out.println(sb.toString());
            --t;
        }
    }
    static int lower(int s,int e,int a[],int s1){
        int ans=a[s];
        int mid=(s+e)/2;
        while(s<=e){
            if(a[mid]<=s1){
                ans=a[mid];
                s=mid+1;
            }
            else
                e=mid-1;
            mid=(s+e)/2;
        }
        return ans;
    }
        static int upper(int s,int e,int a[],int s1){
        int ans=a[e];
        int mid=(s+e)/2;
        while(s<=e){
            if(a[mid]>=s1){
                ans=a[mid];
                e=mid-1;
            }
            else
                s=mid+1;
            mid=(s+e)/2;
        }
            return ans;
    }
    static void dfs(int c,int p,int s){
        int y=0;
        for(int i=0;i<adj.get(c).size();i++){
            if(adj.get(c).get(i)==p)
                continue;
            dfs(adj.get(c).get(i),c,s+1);
            ++y;
        }
        if(y==0){
            //map.put(c,0);
            //System.out.println(c+" "+s);
            q.add(new Student(c,s,0));
        }
    }
    static long nCr(long n, long r, 
                                    long p) 
    { 
        return (fac[(int)n]* modInverse(fac[(int)r], p) 
                % p * modInverse(fac[(int)(n-r)], p) 
                                    % p) % p; 
    } 
    public static void main(String[] args){
        //long sum=0;
        try {
                codeforces.solve();
                } catch (Exception e) {
                    e.printStackTrace();
                }
    }
       static long modInverse(long n, long p) 
    { 
        return power(n, p-(long)2, p); 
    } 
 static long power(long x, long y, long p) 
{ 
    long res = 1;      // Initialize result 
  
    x = x % p;  // Update x if it is more than or  
                // equal to p 
  
    while (y > 0) 
    { 
        // If y is odd, multiply x with result 
        if (y %(long)2!=0) 
            res = (res*x) % p; 
  
        // y must be even now 
        y = y>>1; // y = y/2 
        x = (x*x) % p;   
    } 
    return res%p;
 }
   static int find(int x) 
    { 
        // Finds the representative of the set 
        // that x is an element of 
        while(parent[x]!=x) 
        { 
            // if x is not the parent of itself 
            // Then x is not the representative of 
            // his set,
            x=parent[x];
  
            // so we recursively call Find on its parent 
            // and move i's node directly under the 
            // representative of this set 
        } 
  
        return x; 
    }
    static void union(int x, int y) 
    { 
        // Find representatives of two sets 
        int xRoot = find(x), yRoot = find(y); 
  
        // Elements are in the same set, no need 
        // to unite anything. 
        if (xRoot == yRoot) 
            return; 
  
         // If x's rank is less than y's rank 
        if (rank[xRoot] < rank[yRoot]) 
  
            // Then move x under y  so that depth 
            // of tree remains less 
            parent[xRoot] = yRoot; 
  
        // Else if y's rank is less than x's rank 
        else if (rank[yRoot] < rank[xRoot]) 
  
            // Then move y under x so that depth of 
            // tree remains less 
            parent[yRoot] = xRoot; 
  
        else // if ranks are the same 
        { 
            // Then move y under x (doesn't matter 
            // which one goes where) 
            parent[yRoot] = xRoot; 
  
            // And increment the the result tree's 
            // rank by 1 
            rank[xRoot] = rank[xRoot] + 1; 
        } 
    } 
    static int gcd(int a, int b) 
    { 
        if (a == 0) 
            return b; 
        return gcd(b % a, a); 
    }
}