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 int B = 11;
const int LEN = 65;
int q;
long long dp[B][LEN][1 << B];
long long DP[B][LEN];
long long f(int base, int len, int mask) {
  if (dp[base][len][mask] == -1) {
    if (!len) return dp[base][len][mask] = (mask == 0);
    dp[base][len][mask] = 0;
    for (int d = 0; d <= base - 1; d++)
      dp[base][len][mask] += f(base, len - 1, mask ^ (1 << d));
  }
  return dp[base][len][mask];
}
void precompute() {
  memset(dp, -1, sizeof(dp));
  for (int base = 2; base <= 10; base++)
    for (int len = 1; len <= LEN - 1; len++) {
      DP[base][len] += DP[base][len - 1];
      for (int d = 1; d <= base - 1; d++)
        DP[base][len] += f(base, len - 1, 1 << d);
    }
}
long long get(int b, long long x) {
  if (!x) return 0;
  vector<int> vec;
  while (x) {
    vec.push_back(x % b);
    x /= b;
  }
  vec.push_back(-1);
  reverse(vec.begin(), vec.end());
  int n = (int)(vec).size() - 1;
  long long ans = DP[b][n - 1];
  int mask = 0;
  for (int i = n; i >= 1; i--) {
    int num = vec[i];
    for (int d = 1; d <= num - 1; d++) ans += f(b, i - 1, mask ^ (1 << d));
    mask ^= (1 << num);
  }
  ans += (mask == 0);
  return ans;
}
long long query(int b, long long l, long long r) {
  return get(b, r) - get(b, l - 1);
}
int main() {
  precompute();
  scanf("%d", &q);
  while (q--) {
    int b;
    long long l, r;
    scanf("%d %lld %lld", &b, &l, &r);
    printf("%lld\n", query(b, l, r));
  }
  return 0;
}
