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;
const long long B = 64;
long long f[15][B + 10][2500], L, R;
long long len, a[B + 10], n, q, b, l[B], r[B];
inline long long dfs(long long type, long long pos, long long state, bool limit,
                     bool flag) {
  if (!pos) return !state;
  if (f[type][pos][state] != -1 && !limit && !flag) return f[type][pos][state];
  long long num;
  long long res = 0;
  if (limit)
    num = r[pos];
  else
    num = b - 1;
  for (long long i = 0; i <= num; i++) {
    if (flag && (!i))
      res += dfs(type, pos - 1, state, limit & (i == r[pos]), 1);
    else
      res += dfs(type, pos - 1, state ^ (1 << i), limit & (i == r[pos]), 0);
  }
  if (!limit && !flag) f[type][pos][state] = res;
  return res;
}
signed main() {
  memset(f, -1, sizeof f);
  cin >> q;
  while (q--) {
    scanf("%lld%lld%lld", &b, &L, &R);
    L--;
    memset(l, 0, sizeof l);
    memset(r, 0, sizeof r);
    for (long long i = 1; i <= B; i++) {
      l[i] = L % b;
      L /= b;
      r[i] = R % b;
      R /= b;
    }
    long long ans = dfs(b, B, 0, 1, 1);
    memcpy(r, l, sizeof l);
    printf("%lld\n", ans - dfs(b, B, 0, 1, 1));
  }
  return 0;
}
