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;
long long a[1001010], f[20][1 << 10];
long long L, R, T, wei, b;
long long dfs(int pos, int state, int lead, int limit) {
  if (pos == -1) {
    return (state == (1 << b) - 1) ? 1 : 0;
  }
  if (!limit && !lead && f[pos][state] != -1) return f[pos][state];
  long long tmp = 0, Up = (limit == 0) ? b - 1 : a[pos];
  for (int i = 0; i <= Up; i++)
    tmp += dfs(pos - 1, (lead && i == 0) ? state : (1 << i) ^ state,
               lead && (i == 0), limit && (i == Up));
  if (!limit && !lead) f[pos][state] = tmp;
  return tmp;
}
long long solve(long long x) {
  memset(f, -1, sizeof(f));
  int pos = 0;
  while (x) {
    a[pos++] = x % b;
    x /= b;
  }
  return dfs(pos - 1, (1 << b) - 1, 1, 1);
}
int main() {
  scanf("%I64d", &T);
  while (T--) {
    scanf("%I64d%I64d%I64d", &b, &L, &R);
    printf("%I64d\n", solve(R) - solve(L - 1));
  }
  return 0;
}
