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 N = 100;
long long q, b;
long long l, r;
long long a[N];
long long f[2][2][N][10005];
long long dfs(long long pos, long long num, long long limit, long long lead) {
  if (!pos) return num == 0;
  if (f[limit][lead][pos][num] > -1) return f[limit][lead][pos][num];
  long long r = limit ? a[pos] : b - 1, ret = 0;
  for (long long i = 0; i <= r; i++)
    ret += dfs(pos - 1, (lead && i == 0) ? num : num ^ (1 << i),
               limit && i == a[pos], lead && i == 0);
  return f[limit][lead][pos][num] = ret;
}
long long solve(long long x) {
  long long cnt = 0;
  while (x) {
    a[++cnt] = x % b;
    x /= b;
  }
  return dfs(cnt, 0, true, true);
}
signed main() {
  scanf("%lld", &q);
  while (q--) {
    memset(f, -1, sizeof f);
    scanf("%lld%lld%lld", &b, &l, &r);
    printf("%lld\n", solve(r) - solve(l - 1));
  }
  return 0;
}
