#include <bits/stdc++.h>
using namespace std;
int gcdExtended(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long int modInverse(int a, int m) {
  int x, y;
  int g = gcdExtended(a, m, &x, &y);
  long long int res = ((long long int)x % m + (long long int)m) % m;
  return res;
}
long long int poww(long long int x, long long int n) {
  if (n == 0)
    return 1;
  else if (n == 1)
    return x;
  else if (n % 2 == 0)
    return poww(x * x, n / 2);
  else
    return x * poww(x * x, (n - 1) / 2);
}
long long int modularExponentiation(long long int x, long long int n,
                                    long long int M) {
  long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % M;
    x = (x * x) % M;
    n = n / 2;
  }
  return result;
}
template <typename T>
T maxx(T a, T b) {
  if (a < b) return b;
  return b;
}
template <typename T, typename... Args>
T maxx(T a, T b, Args... args) {
  return (maxx(maxx(a, b), args...));
}
template <typename T>
T minn(T a, T b) {
  if (a < b) return a;
  return b;
}
template <typename T, typename... Args>
T minn(T a, T b, Args... args) {
  return (minn(minn(a, b), args...));
}
int gcd(int a, int b) {
  if (a == 0) return b;
  if (b == 0) return a;
  if (a == b) return a;
  if (a > b)
    return gcd(a - b, b);
  else
    return gcd(a, b - a);
}
long long int ncr(int n, int r) {
  long long int ans = 1;
  r = min(r, n - r);
  for (int i = 0; i < r; i++) {
    ans = (ans * (n - i) / (i + 1)) % 1000000007;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    long long int n, m, k, l, r;
    cin >> n >> l >> r;
    l--;
    m = 0;
    k = 1;
    while (m + (n - k) * 2 <= l && k < n) {
      m += (n - k) * 2;
      k++;
    }
    long long int temp = m;
    vector<long long int> v;
    while (m <= r) {
      long long int z = k;
      if (k != n) {
        for (int i = 0; i < (n - k); i++) {
          m += 2;
          v.push_back(k);
          v.push_back(++z);
        }
        k++;
      } else {
        v.push_back(1);
        break;
      }
    }
    for (int i = 0; i < r - l; i++) {
      cout << v[l - temp + i] << " ";
    }
    cout << '\n';
  }
  return 0;
}

### Prompt

Generate 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 gcdExtended(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long int modInverse(int a, int m) {
  int x, y;
  int g = gcdExtended(a, m, &x, &y);
  long long int res = ((long long int)x % m + (long long int)m) % m;
  return res;
}
long long int poww(long long int x, long long int n) {
  if (n == 0)
    return 1;
  else if (n == 1)
    return x;
  else if (n % 2 == 0)
    return poww(x * x, n / 2);
  else
    return x * poww(x * x, (n - 1) / 2);
}
long long int modularExponentiation(long long int x, long long int n,
                                    long long int M) {
  long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % M;
    x = (x * x) % M;
    n = n / 2;
  }
  return result;
}
template <typename T>
T maxx(T a, T b) {
  if (a < b) return b;
  return b;
}
template <typename T, typename... Args>
T maxx(T a, T b, Args... args) {
  return (maxx(maxx(a, b), args...));
}
template <typename T>
T minn(T a, T b) {
  if (a < b) return a;
  return b;
}
template <typename T, typename... Args>
T minn(T a, T b, Args... args) {
  return (minn(minn(a, b), args...));
}
int gcd(int a, int b) {
  if (a == 0) return b;
  if (b == 0) return a;
  if (a == b) return a;
  if (a > b)
    return gcd(a - b, b);
  else
    return gcd(a, b - a);
}
long long int ncr(int n, int r) {
  long long int ans = 1;
  r = min(r, n - r);
  for (int i = 0; i < r; i++) {
    ans = (ans * (n - i) / (i + 1)) % 1000000007;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    long long int n, m, k, l, r;
    cin >> n >> l >> r;
    l--;
    m = 0;
    k = 1;
    while (m + (n - k) * 2 <= l && k < n) {
      m += (n - k) * 2;
      k++;
    }
    long long int temp = m;
    vector<long long int> v;
    while (m <= r) {
      long long int z = k;
      if (k != n) {
        for (int i = 0; i < (n - k); i++) {
          m += 2;
          v.push_back(k);
          v.push_back(++z);
        }
        k++;
      } else {
        v.push_back(1);
        break;
      }
    }
    for (int i = 0; i < r - l; i++) {
      cout << v[l - temp + i] << " ";
    }
    cout << '\n';
  }
  return 0;
}

```