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 l, r, b, q, a[105], dp[105][100005];
long long dfs(long long len, long long st, long long zero, long long lim) {
  if (len == 0) return (st == (1 << b) - 1);
  if (!zero && !lim && dp[len][st] != -1) return dp[len][st];
  long long ans = 0, ma = lim ? a[len] : b - 1;
  for (long long i = 0; i <= ma; i++)
    ans += dfs(len - 1, (zero && i == 0) ? st : st ^ (1 << i), zero && i == 0,
               lim && i == ma);
  if (!zero && !lim) dp[len][st] = ans;
  return ans;
}
long long solve(long long x) {
  long long len = 0;
  while (x) {
    a[++len] = x % b;
    x /= b;
  }
  return dfs(len, (1 << b) - 1, 1, 1);
}
signed main() {
  memset(dp, -1, sizeof(dp));
  scanf("%lld", &q);
  while (q--) {
    scanf("%lld%lld%lld", &b, &l, &r);
    if (l == 1ll)
      printf("%lld\n", solve(r));
    else
      printf("%lld\n", solve(r) - solve(l - 1));
  }
  return 0;
}
