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 int B = 10;
const int L = 70;
long long f[11][1 << 12][80];
int a[80];
inline long long query(int b, long long x) {
  int cur = 0;
  while (x) {
    a[++cur] = x % b;
    x /= b;
  }
  long long ans = 0;
  for (int i = 1; i < cur; i++) {
    ans += f[b][0][i] - f[b][1][i - 1];
  }
  int last = 0;
  for (int i = cur; i >= 1; i--) {
    int v = 0;
    if (i == cur) v = 1;
    for (int j = v; j < a[i]; j++) {
      int buf = last ^ (1 << j);
      ans += f[b][buf][i - 1];
    }
    last ^= 1 << a[i];
  }
  return ans;
}
int main() {
  memset(f, 0, sizeof(f));
  for (int i = 2; i <= B; i++) f[i][0][0] = 1;
  for (int i = 2; i <= B; i++)
    for (int k = 1; k <= L; k++)
      for (int j = 0; j < (1 << i); j++)
        for (int l = 0; l < B; l++) f[i][j][k] += f[i][j ^ (1 << l)][k - 1];
  int q;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int b;
    scanf("%d", &b);
    long long l, r;
    scanf("%I64d%I64d", &l, &r);
    printf("%I64d\n", query(b, r) - query(b, l - 1));
  }
  return 0;
}
