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;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while ('0' <= ch && ch <= '9') x = x * 10 + (ch & 15), ch = getchar();
  return x * f;
}
long long s[2][13][73][1103], f[2][13][73][1103], num[73], cnt;
long long dfs(long long now, long long k, long long st, long long zero,
              long long flg) {
  if (!now)
    if (zero || st)
      return 0;
    else
      return 1;
  if (!flg && f[zero][k][now][st]) return s[zero][k][now][st];
  long long sum = 0;
  if (flg) {
    for (long long i = 1; i < num[now]; i++)
      sum += dfs(now - 1, k, st ^ (1 << i), 0, 0);
    if (zero)
      sum += dfs(now - 1, k, 0, 1, (num[now] == 0));
    else
      sum += dfs(now - 1, k, st ^ 1, 0, (num[now] == 0));
    if (num[now] != 0) sum += dfs(now - 1, k, st ^ (1 << num[now]), 0, 1);
  } else {
    for (long long i = 1; i < k; i++)
      sum += dfs(now - 1, k, st ^ (1 << i), 0, 0);
    if (zero)
      sum += dfs(now - 1, k, 0, 1, 0);
    else
      sum += dfs(now - 1, k, st ^ 1, 0, 0);
  }
  if (!flg) {
    f[zero][k][now][st] = 1;
    return s[zero][k][now][st] = sum;
  } else
    return sum;
}
long long solve(long long k, long long x) {
  if (x == 0) return 0;
  cnt = 0;
  while (x) num[++cnt] = x % k, x /= k;
  return dfs(cnt, k, 0, 1, 1);
}
signed main() {
  for (long long T = read(), k, l, r; T--;)
    k = read(), l = read(), r = read(),
    printf("%lld\n", solve(k, r) - solve(k, l - 1));
  return 0;
}
