#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  for (int i = (0); i < (t); i += 1) {
    long long n, l, r;
    cin >> n >> l >> r;
    bool z = false;
    if (r == n * (n - 1) + 1) {
      r--;
      z = true;
    }
    vector<int> arr;
    long long cnt = 0;
    bool stop = false;
    for (int j = (1); j < (n + 1); j += 1) {
      if (cnt + (2 * (n - j)) < l) {
        cnt += (2 * (n - j));
        continue;
      } else {
        for (int a = (j); a < (n + 1); a += 1) {
          if (stop) break;
          for (int k = (a + 1); k < (n + 1); k += 1) {
            cnt++;
            if (cnt > r) {
              stop = true;
              break;
            }
            if (cnt >= l) {
              arr.push_back(a);
            }
            cnt++;
            if (cnt > r) {
              stop = true;
              break;
            }
            if (cnt >= l) {
              arr.push_back(k);
            }
          }
        }
        break;
      }
    }
    if (z) arr.push_back(1);
    for (int j = (0); j < (arr.size()); j += 1) cout << arr[j] << " ";
    cout << "\n";
  }
  return 0;
}

### Prompt

Your challenge is to write 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;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  for (int i = (0); i < (t); i += 1) {
    long long n, l, r;
    cin >> n >> l >> r;
    bool z = false;
    if (r == n * (n - 1) + 1) {
      r--;
      z = true;
    }
    vector<int> arr;
    long long cnt = 0;
    bool stop = false;
    for (int j = (1); j < (n + 1); j += 1) {
      if (cnt + (2 * (n - j)) < l) {
        cnt += (2 * (n - j));
        continue;
      } else {
        for (int a = (j); a < (n + 1); a += 1) {
          if (stop) break;
          for (int k = (a + 1); k < (n + 1); k += 1) {
            cnt++;
            if (cnt > r) {
              stop = true;
              break;
            }
            if (cnt >= l) {
              arr.push_back(a);
            }
            cnt++;
            if (cnt > r) {
              stop = true;
              break;
            }
            if (cnt >= l) {
              arr.push_back(k);
            }
          }
        }
        break;
      }
    }
    if (z) arr.push_back(1);
    for (int j = (0); j < (arr.size()); j += 1) cout << arr[j] << " ";
    cout << "\n";
  }
  return 0;
}

```