10
4 108 114
5 30 155
8 193 197
9 71 169
2 163 166
8 120 144
8 22 151
4 21 166
2 46 127
8 38 51
 20
9 142 172
7 132 256
8 245 315
9 496 496
3 345 362
8 13 162
5 342 470
9 16 488
9 467 482
4 471 478
10 92 224
6 228 261
9 54 167
2 402 409
5 9 10
7 225 360
3 438 483
6 252 342
3 491 493
6 296 367
 1
8 1234567890123 123456789012345

0
3
0
1
3
0
5
16
9
1
 0
0
0
0
4
6
13
7
0
0
1
2
3
0
0
2
12
9
1
4
 774752389568

#include <bits/stdc++.h>
using namespace std;
int b;
long long d[11][100][1 << 11];
vector<int> a;
inline long long go(int len, int mask) {
  if (len < 0) return !mask;
  if (d[b][len][mask] != -1) return d[b][len][mask];
  long long &res = d[b][len][mask];
  res = 0;
  for (int i = 0; i < b; ++i) {
    res += go(len - 1, mask ^ (1 << i));
  }
  return res;
}
inline long long get(long long x) {
  a.clear();
  for (long long i = x; i; i /= b) a.push_back(i % b);
  if (!x) a = {0};
  reverse(a.begin(), a.end());
  long long res = 0;
  for (int i = 0; i < (int(a.size())) - 1; ++i)
    for (int j = 1; j < b; ++j) res += go(i - 1, 1 << j);
  int mask = 0;
  for (int i = (int(a.size())) - 1; i >= 0; --i) {
    for (int j = i == (int(a.size())) - 1; j < a[i]; ++j) {
      res += go(i - 1, mask ^ (1 << j));
    }
    mask ^= (1 << a[i]);
  }
  if (!mask) ++res;
  return res;
}
inline void solve() {
  long long l, r;
  scanf(
      "%d"
      "%lld"
      ""
      "%lld",
      &b, &l, &r);
  printf(
      "%lld"
      "\n",
      get(r) - get(l - 1));
}
int main() {
  memset(d, -1, sizeof(d));
  int tt;
  scanf("%d", &tt);
  for (int t = 0; t < tt; ++t) solve();
  return 0;
}
