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;
int T;
long long DP[11][1 << 11][70];
long long A, B, C;
long long get_dp(long long b, long long status, long long len) {
  if (DP[b][status][len] != -1) return DP[b][status][len];
  if (len == 0) return DP[b][status][len] = (status == 0);
  long long &ret = DP[b][status][len] = 0;
  for (int i = 0; i < b; i++) ret += get_dp(b, status ^ (1 << i), len - 1);
  return ret;
}
long long solve(long long b, long long val) {
  vector<int> v;
  while (val) v.push_back(val % b), val /= b;
  reverse(v.begin(), v.end());
  long long ret = 0, len = v.size();
  long long status = 0;
  for (int i = 0; i < len; i++) {
    for (int j = 0 + (i == 0); j < v[i]; j++)
      ret += get_dp(b, status ^ (1 << j), len - 1 - i);
    status ^= (1 << v[i]);
  }
  for (int i = 1; i < len; i++) ret += get_dp(b, 0, i) - get_dp(b, 1, i - 1);
  return ret;
}
int main(void) {
  memset(DP, -1, sizeof(DP));
  cin >> T;
  for (int t = 1; t <= T; t++) {
    cin >> A >> B >> C;
    long long ans = solve(A, C);
    ans -= solve(A, B - 1);
    cout << ans << '\n';
  }
  return 0;
}
