#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007, N = 1e5 + 5, M = 1e5 + 5, INF = 0x3f3f3f3f;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    long long n, l, r;
    cin >> n >> l >> r;
    if (l == r && l == n * (n - 1) + 1) {
      cout << 1 << endl;
      continue;
    }
    int nowx = 1, nowy = 2;
    long long sum = 0;
    while (sum < l) {
      sum += 2 * (n - nowx);
      ++nowx;
    }
    --nowx;
    sum -= 2 * (n - nowx);
    ++sum;
    vector<int> ans;
    nowy = nowx + 1;
    int di = 1;
    int cnt = sum;
    while (sum <= r) {
      if (di)
        ans.push_back(nowx);
      else {
        ans.push_back(nowy);
        ++nowy;
        if (nowy > n) {
          nowx++;
          nowy = nowx + 1;
          if (nowx > n) nowx = 1;
        }
      }
      ++sum;
      di ^= 1;
    }
    if (r == n * (n - 1) + 1) ans[ans.size() - 1] = 1;
    cout << ans[l - cnt];
    for (long long i = l - cnt + 1; i <= r - cnt; ++i) cout << ' ' << ans[i];
    cout << endl;
  }
  return 0;
}

### Prompt

Please formulate a Cpp solution to the following 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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007, N = 1e5 + 5, M = 1e5 + 5, INF = 0x3f3f3f3f;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    long long n, l, r;
    cin >> n >> l >> r;
    if (l == r && l == n * (n - 1) + 1) {
      cout << 1 << endl;
      continue;
    }
    int nowx = 1, nowy = 2;
    long long sum = 0;
    while (sum < l) {
      sum += 2 * (n - nowx);
      ++nowx;
    }
    --nowx;
    sum -= 2 * (n - nowx);
    ++sum;
    vector<int> ans;
    nowy = nowx + 1;
    int di = 1;
    int cnt = sum;
    while (sum <= r) {
      if (di)
        ans.push_back(nowx);
      else {
        ans.push_back(nowy);
        ++nowy;
        if (nowy > n) {
          nowx++;
          nowy = nowx + 1;
          if (nowx > n) nowx = 1;
        }
      }
      ++sum;
      di ^= 1;
    }
    if (r == n * (n - 1) + 1) ans[ans.size() - 1] = 1;
    cout << ans[l - cnt];
    for (long long i = l - cnt + 1; i <= r - cnt; ++i) cout << ' ' << ans[i];
    cout << endl;
  }
  return 0;
}

```