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 N = 64, R = 10;
long long dp[R + 1][N + 1][1 << R], pre[R + 1][N + 1];
void build() {
  for (int r = 2; r <= R; r++) {
    pre[r][0] = 1;
    dp[r][0][0] = 1;
    for (int n = 0; n < N; n++) {
      pre[r][n + 1] += pre[r][n];
      for (int mask = 0; mask < 1 << r; mask++) {
        for (int d = 0; d < r; d++) {
          int b = 1 << d;
          dp[r][n + 1][mask ^ b] += dp[r][n][mask];
          if (d > 0 && (mask ^ b) == 0) {
            pre[r][n + 1] += dp[r][n][mask];
          }
        }
      }
    }
  }
}
long long solve(long long x, int r, bool inclusive) {
  vector<int> a;
  while (x > 0) {
    a.push_back(x % r);
    x /= r;
  }
  int n = a.size();
  long long ans = pre[r][n - 1];
  int mask = 0;
  for (int i = n; i--;) {
    for (int d = i == n - 1; d < a[i]; d++) {
      int b = 1 << d;
      ans += dp[r][i][1 << r ^ mask ^ b];
    }
    mask ^= 1 << a[i];
  }
  if (inclusive && mask == 0) ans++;
  return ans;
}
int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  build();
  int q;
  cin >> q;
  while (q--) {
    int b;
    long long l, r;
    cin >> b >> l >> r;
    cout << solve(r, b, true) - solve(l, b, false) << '\n';
  }
}
