#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
long long pows(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long powm(long long x, long long y, long long m = 1000000007) {
  x = x % m;
  long long res = 1;
  while (y) {
    if (y & 1) res = res * x;
    res %= m;
    y = y >> 1;
    x = x * x;
    x %= m;
  }
  return res;
}
long long modInverse(long long a, long long m = 1000000007) {
  if (m == 1) return 0;
  long long m0 = m, y = 0, x = 1;
  while (a > 1) {
    long long q = a / m, t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
vector<long long> par(5005), sizes(5005);
long long find_par(long long x) {
  if (x == par[x]) {
    return x;
  }
  return (par[x] = find_par(par[x]));
}
void union_sets(long long a, long long b) {
  a = find_par(a);
  b = find_par(b);
  if (a != b) {
    if (sizes[a] < sizes[b]) {
      swap(a, b);
    }
    sizes[a] += sizes[b];
    par[b] = a;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long T;
  cin >> T;
  while (T--) {
    long long n, m, i, j, k, x, y, z, t, e, f, p, q, g, l, r, w, h,
        count1 = 0, prod = 1, a, b, c, d, index, x1, x2, y1, y2, diff, ans = 0,
        sum = 0, sum1 = 0, sum2 = 0, flag = 0, flag1 = 0, flag2 = 0;
    string s, s1, s2;
    cin >> n >> l >> r;
    sum = 0;
    k = 1;
    if (l == r && l == (n * (n - 1) + 1)) {
      cout << "1\n";
      continue;
    }
    while (sum + 2 * (n - k) < l) {
      sum += 2 * (n - k);
      k++;
    }
    long long start, cur;
    if (l % 2 == 1) {
      start = k;
      x = k + (l - sum + 1) / 2;
      cur = l;
    } else {
      cout << k + (l - sum + 1) / 2 << " ";
      if (k + (l - sum + 1) / 2 == n) {
        start = k + 1;
        x = start + 1;
      } else {
        start = k;
        x = k + (l - sum + 1) / 2 + 1;
      }
      cur = l + 1;
    }
    a = 0;
    while (cur <= r) {
      if (a % 2 == 0) {
        cout << start << " ";
      } else {
        cout << x << " ";
        x++;
      }
      if (x == n + 1) {
        start++;
        x = start + 1;
      }
      if (start == n) {
        start = 1;
      }
      cur++;
      a++;
    }
    cout << "\n";
    ;
  }
}
