/**
 * @author derrick20
 */
import java.io.*;
import java.util.*;

public class MinEulerCycle {
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner();
        PrintWriter out = new PrintWriter(System.out);

        int T = sc.nextInt();
        while (T-->0) {
            int N = sc.nextInt();
            long l = sc.nextLong();
            long r = sc.nextLong();
            long[] prefix = new long[N];
            prefix[1] = 2 * (N - 1);
            for (int i = 2; i < N; i++) {
                prefix[i] = prefix[i - 1] + 2 * (N - i);
            }

            int pos = 0;
            while (pos + 1 < N && prefix[pos + 1] < l) {
                pos++;
            }
            int startL = (int) (l - prefix[pos]);
            ArrayList<Long> full = new ArrayList<>();
            if (pos == 0) {
                for (int i = 2; i <= N; i++) {
                    full.add(1L);
                    full.add((long) i);
                }
                pos++;
            }
            while (pos + 1 < N && prefix[pos + 1] < r) {
                for (int i = pos + 2; i <= N; i++) {
                    full.add((long) pos + 1);
                    full.add((long) i);
                }
                pos++;
            }
            int endR = (int) (r - prefix[pos]);
            if (pos + 1 < N) {
                // go one further
                for (int i = pos + 2; i <= N && endR > 0; i++) {
                    full.add((long) pos + 1);
                    endR--;
                    if (endR > 0) {
                        full.add((long) i);
                        endR--;
                    }
                }
            }

//            out.println(full);
            if (r == ((long) N) * (long) (N -1) + 1) {
                full.add(1L);
            }
            for (int i = startL - 1; i < full.size(); i++) {
                out.print(full.get(i) + " ");
            }
            out.println();
        }
        out.close();
    }

    static class FastScanner {
        private int BS = 1<<16;
        private char NC = (char)0;
        private byte[] buf = new byte[BS];
        private int bId = 0, size = 0;
        private char c = NC;
        private double cnt = 1;
        private BufferedInputStream in;

        public FastScanner() {
            in = new BufferedInputStream(System.in, BS);
        }

        public FastScanner(String s) {
            try {
                in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
            }
            catch (Exception e) {
                in = new BufferedInputStream(System.in, BS);
            }
        }

        private char getChar(){
            while(bId==size) {
                try {
                    size = in.read(buf);
                }catch(Exception e) {
                    return NC;
                }
                if(size==-1)return NC;
                bId=0;
            }
            return (char)buf[bId++];
        }

        public int nextInt() {
            return (int)nextLong();
        }

        public int[] nextInts(int N) {
            int[] res = new int[N];
            for (int i = 0; i < N; i++) {
                res[i] = (int) nextLong();
            }
            return res;
        }

        public long[] nextLongs(int N) {
            long[] res = new long[N];
            for (int i = 0; i < N; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public long nextLong() {
            cnt=1;
            boolean neg = false;
            if(c==NC)c=getChar();
            for(;(c<'0' || c>'9'); c = getChar()) {
                if(c=='-')neg=true;
            }
            long res = 0;
            for(; c>='0' && c <='9'; c=getChar()) {
                res = (res<<3)+(res<<1)+c-'0';
                cnt*=10;
            }
            return neg?-res:res;
        }

        public double nextDouble() {
            double cur = nextLong();
            return c!='.' ? cur:cur+nextLong()/cnt;
        }

        public String next() {
            StringBuilder res = new StringBuilder();
            while(c<=32)c=getChar();
            while(c>32) {
                res.append(c);
                c=getChar();
            }
            return res.toString();
        }

        public String nextLine() {
            StringBuilder res = new StringBuilder();
            while(c<=32)c=getChar();
            while(c!='\n') {
                res.append(c);
                c=getChar();
            }
            return res.toString();
        }

        public boolean hasNext() {
            if(c>32)return true;
            while(true) {
                c=getChar();
                if(c==NC)return false;
                else if(c>32)return true;
            }
        }
    }
}