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;
template <typename T, typename U>
inline void chkmax(T& x, U y) {
  if (x < y) x = y;
}
template <typename T, typename U>
inline void chkmin(T& x, U y) {
  if (y < x) x = y;
}
int a[100];
long long dp[9][61][1024];
long long calc(int B, long long U) {
  if (U == 0) return 0;
  int n = 0;
  U++;
  while (U) a[n++] = U % B, U /= B;
  reverse(a, a + n);
  long long ret = 0;
  for (int i = 2; i <= n - 1; i += 2) ret += dp[B - 2][i][0];
  int s = 0;
  for (int i = 0; i < n; i++) {
    for (int j = (i == 0); j < a[i]; j++)
      ret += dp[B - 2][n - i - 1][s ^ (1 << (j))];
    s ^= (1 << (a[i]));
  }
  return ret;
}
int main() {
  int q;
  scanf("%d", &q);
  for (int b = 2; b <= 10; b++) {
    dp[b - 2][0][0] = 1;
    for (int j = 1; j < b; j++) dp[b - 2][1][(1 << (j))] = 1;
    for (int i = 2; i <= 60; i++) {
      for (int j = 0; j < (1 << (b)); j++) {
        for (int k = 0; k < b; k++)
          dp[b - 2][i][j] += dp[b - 2][i - 1][j ^ (1 << (k))];
      }
    }
  }
  while (q--) {
    int B;
    long long L, R;
    scanf("%d%lld%lld", &B, &L, &R);
    printf("%lld\n", calc(B, R) - calc(B, L - 1));
  }
  return 0;
}
