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[15][70][1030];
int l, s[70];
long long F(long long n, int b) {
  int l = 0;
  for (long long i = n; i > 0; i /= b) s[++l] = i % b;
  reverse(s + 1, s + l + 1);
  long long ans = 0;
  for (int i = 1; i < l; i++) {
    for (int d = 1; d < b; d++) ans += dp[b][i - 1][1 << d];
  }
  int mask = 0;
  for (int i = 1; i <= l; i++) {
    for (int d = 0; d <= s[i]; d++) {
      if (i == 1 && d == 0) continue;
      if (i < l && d == s[i]) continue;
      ans += dp[b][l - i][mask ^ (1 << d)];
    }
    mask ^= (1 << s[i]);
  }
  return ans;
}
int main() {
  for (int b = 2; b <= 10; b++) {
    dp[b][0][0] = 1;
    for (int i = 0; i < 70; i++) {
      for (int mask = 0; mask < (1 << b); mask++) {
        for (int d = 0; d < b; d++) {
          dp[b][i + 1][mask ^ (1 << d)] += dp[b][i][mask];
        }
      }
    }
  }
  int t;
  scanf("%d", &t);
  while (t--) {
    int b;
    long long x, y;
    scanf("%d%lld%lld", &b, &x, &y);
    printf("%lld\n", F(y, b) - F(x - 1, b));
  }
  return 0;
}
