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[11][64][1010];
long long n, b, num[64];
long long check(long long x) {
  long long res = 0;
  for (; x; x >>= 1)
    if (x & 1) res++;
  return res;
}
long long dfs(long long len, long long status, bool lim, bool first) {
  if (len < 1) return status == 0;
  long long times = check(status);
  if (times > len) return 0;
  if ((times & 1) ^ (len & 1)) return 0;
  if ((len & 1) && status == 0) return 0;
  if (dp[b][len][status] && !lim && !first) return dp[b][len][status];
  long long up = lim ? num[len] : b - 1;
  long long res = 0;
  for (long long i = first; i <= up; i++) {
    res += dfs(len - 1, status ^ (1 << i), (lim && i == up), 0);
  }
  if (!lim && !first) dp[b][len][status] = res;
  return res;
}
long long solve(long long x) {
  long long tot = 0;
  for (; x; x /= b) num[++tot] = x % b;
  long long res = 0;
  for (long long i = 1; i <= tot; i++) {
    res += dfs(i, 0, (i == tot), 1);
  }
  return res;
}
int main() {
  long long ttt, l, r;
  scanf("%lld", &ttt);
  while (ttt--) {
    scanf("%lld%lld%lld", &b, &l, &r);
    printf("%lld\n", solve(r) - solve(l - 1));
  }
  return 0;
}
