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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long T;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> T;
  while (T--) {
    long long n, l, r;
    cin >> n >> l >> r;
    long long g = n * (n - 1) + 1;
    if (l == g - 1) {
      if (r == g)
        cout << n << " 1" << '\n';
      else
        cout << "1" << '\n';
      continue;
    }
    if (l == g) {
      cout << "1" << '\n';
      continue;
    }
    long long k = (l + 1) / 2, ls = 2, ln, p = 0;
    while (p + (n - ls + 1) < k) p += (n - ls + 1), ls++;
    ln = ls;
    while (p + 1 < k) ln++, p++;
    long long lo, los = 1, loo;
    p = 0;
    k = l / 2 + 1;
    while (p + (n - los) < k) p += (n - los), los++;
    loo = los;
    lo = n - los;
    while (p + 1 < k) p++, lo--;
    for (long long i = l; i <= r; i++) {
      if (i & 1) {
        cout << loo << " ";
        lo--;
        if (!lo) loo++, lo = n - loo;
        if (loo == n) loo = 1;
      } else {
        cout << ln << " ";
        if (ln == n) {
          ln = (++ls);
        } else
          ln++;
      }
    }
    cout << '\n';
  }
  return 0;
}