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;
const long long mo = 1e9 + 7;
long long q, b, l[75], r[75], L, R, ans, dp[15][75][2205];
long long dfs(long long typ, int id, long long s, bool lim, bool pre) {
  if (!id) return !s;
  int up = lim ? r[id] : b - 1, sum = 0;
  if (dp[typ][id][s] >= 0 && !lim && !pre) return dp[typ][id][s];
  for (int i = up; i >= 0; i--) {
    if (pre && (!i)) {
      sum += dfs(typ, id - 1, s, (i == r[id]) & lim, 1);
      continue;
    }
    sum += dfs(typ, id - 1, s ^ (1 << i), (i == r[id]) & lim, 0);
  }
  if (lim | pre) return sum;
  return dp[typ][id][s] = sum;
}
signed main() {
  memset(dp, -1, sizeof(dp));
  scanf("%lld", &q);
  while (q--) {
    scanf("%lld %lld %lld", &b, &L, &R);
    L--;
    for (int i = 1; i <= 64; i++) {
      l[i] = L % b;
      L /= b;
      r[i] = R % b;
      R /= b;
    }
    ans = dfs(b, 64, 0, 1, 1);
    for (int i = 1; i <= 64; i++) r[i] = l[i];
    printf("%lld\n", ans - dfs(b, 64, 0, 1, 1));
  }
  return 0;
}
