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, dg[100];
long long mp[11][100][1 << 10];
long long dfs(int pos, bool up, bool has, int s) {
  if (pos < 0) return s == 0;
  if (!up && mp[b][pos][s]) return mp[b][pos][s];
  int top = (up ? dg[pos] : b - 1);
  long long res = 0;
  for (int i = 0; i <= top; i++) {
    if (i == 0) {
      if (has)
        res += dfs(pos - 1, up && (i == top), has && (i == 0), 0);
      else
        res += dfs(pos - 1, up && (i == top), has && (i == 0), s ^ (1 << i));
    } else
      res += dfs(pos - 1, up && (i == top), has && (i == 0), s ^ (1 << i));
  }
  if (!has && !up) mp[b][pos][s] = res;
  return res;
}
long long get(long long x) {
  int cnt = 0;
  while (x) {
    dg[cnt++] = x % b;
    x /= b;
  }
  return dfs(cnt - 1, true, true, 0);
}
int main() {
  int T;
  memset(mp, 0, sizeof(mp));
  scanf("%d", &T);
  while (T--) {
    long long l, r;
    scanf("%d%lld%lld", &b, &l, &r);
    printf("%lld\n", get(r) - get(l - 1));
  }
}
