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 dp[2][80][1024];
int base, a[80];
long long dfs(int pos, int mask, int ok, int limit) {
  if (pos < 0) return mask == 0;
  if (!limit && !ok && ~dp[ok][pos][mask]) return dp[ok][pos][mask];
  int top = limit ? a[pos] : base - 1;
  long long res = 0;
  for (int i = 0; i <= top; i++) {
    if (ok) {
      if (i == 0)
        res += dfs(pos - 1, mask, ok, limit && (i == top));
      else
        res += dfs(pos - 1, mask ^ (1 << i), ok ^ 1, limit && (i == top));
    } else {
      res += dfs(pos - 1, mask ^ (1 << i), ok, limit && (i == top));
    }
  }
  if (!limit && !ok) dp[ok][pos][mask] = res;
  return res;
}
long long f(long long x) {
  int cnt = 0;
  while (x) {
    a[cnt++] = x % base;
    x /= base;
  }
  return dfs(cnt - 1, 0, 1, 1);
}
int main() {
  int q;
  long long l, r;
  scanf("%d", &q);
  memset(dp, -1, sizeof(dp));
  while (q--) {
    scanf("%d%I64d%I64d", &base, &l, &r);
    printf("%I64d\n", f(r) - f(l - 1));
  }
  return 0;
}
