Problem: You are given a complete directed graph K_n with n vertices: each pair of vertices u ≠ v in K_n have both directed edges (u, v) and (v, u); there are no self-loops.

You should find such a cycle in K_n that visits every directed edge exactly once (allowing for revisiting vertices).

We can write such cycle as a list of n(n - 1) + 1 vertices v_1, v_2, v_3, ..., v_{n(n - 1) - 1}, v_{n(n - 1)}, v_{n(n - 1) + 1} = v_1 — a visiting order, where each (v_i, v_{i + 1}) occurs exactly once.

Find the lexicographically smallest such cycle. It's not hard to prove that the cycle always exists.

Since the answer can be too large print its [l, r] segment, in other words, v_l, v_{l + 1}, ..., v_r.

Input

The first line contains the single integer T (1 ≤ T ≤ 100) — the number of test cases.

Next T lines contain test cases — one per line. The first and only line of each test case contains three integers n, l and r (2 ≤ n ≤ 10^5, 1 ≤ l ≤ r ≤ n(n - 1) + 1, r - l + 1 ≤ 10^5) — the number of vertices in K_n, and segment of the cycle to print.

It's guaranteed that the total sum of n doesn't exceed 10^5 and the total sum of r - l + 1 doesn't exceed 10^5.

Output

For each test case print the segment v_l, v_{l + 1}, ..., v_r of the lexicographically smallest cycle that visits every edge exactly once.

Example

Input


3
2 1 3
3 3 6
99995 9998900031 9998900031


Output


1 2 1 
1 3 2 3 
1 

Note

In the second test case, the lexicographically minimum cycle looks like: 1, 2, 1, 3, 2, 3, 1.

In the third test case, it's quite obvious that the cycle should start and end in vertex 1.

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Itwazonce
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        scan in = new scan(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        minimumeulercycle solver = new minimumeulercycle();
        solver.solve(1, in, out);
        out.close();
    }

    static class minimumeulercycle {
        public void solve(int testNumber, scan in, PrintWriter out) {
            int t = in.scanInt();
            while (t-- > 0) {
                long n = in.scanLong();
                long l = in.scanLong();
                long r = in.scanLong();
                int len = (int) (r - l + 1);
                long ans[] = new long[len];
                int k = 0;
                long total = 0;
                for (long i = 1; k < len && i <= n; i++) {
                    total = 2 * (i * n - (i * (i + 1)) / 2);
                    if (l <= total) {
                        total -= 2 * (n - i);
                        for (long j = i + 1; k < ans.length && j <= n; j++) {
                            total++;
                            if (l <= total && total <= r) {
                                ans[k++] = i;
                            }
                            total++;
                            if (l <= total && total <= r) {
                                ans[k++] = j;
                            }
                        }
                    }

                }


                for (int i = 0; i < ans.length; i++) {
                    if (ans[i] == 0)
                        ans[i] = 1;
                    out.print(ans[i] + " ");
                }
                out.println();
            }
        }

    }

    static class scan {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public scan(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0)
                    return -1;
            }
            return buf[index++];
        }

        public int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                }
//            else throw new InputMismatchException();
            }
            return neg * integer;
        }

        public long scanLong() {
            long lon = 0;
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n) && n != '.') {
                if (n >= '0' && n <= '9') {
                    lon *= 10;
                    lon += n - '0';
                    n = scan();
                }
//            else throw new InputMismatchException();
            }
            return lon * neg;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1)
                return true;
            return false;
        }

    }
}