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[12][61][1024];
long long solve(long long X, int base) {
  if (X == 0) return 0;
  long long Y = X;
  vector<int> digits;
  while (Y) {
    digits.push_back(Y % base);
    Y /= base;
  }
  reverse(digits.begin(), digits.end());
  long long ans = 0;
  for (int len = 1; len < (int)digits.size(); len++) {
    ans += dp[base][len][0];
  }
  int mask = 0;
  int Len = (int)digits.size();
  for (int mis_match = 0; mis_match < (int)digits.size(); mis_match++) {
    int d = digits[mis_match];
    int l = (mis_match > 0 ? 0 : 1);
    for (int place = l; place < d; place++) {
      mask ^= (1 << place);
      ans += dp[base][Len - mis_match - 1][mask];
      if (Len - mis_match - 2 >= 0) {
        mask ^= 1;
        ans += dp[base][Len - mis_match - 2][mask];
        mask ^= 1;
      }
      mask ^= (1 << place);
    }
    mask ^= (1 << d);
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  for (int base = 2; base <= 10; base++) {
    dp[base][0][0] = 1;
    for (int len = 1; len <= 60; len++) {
      int l = 0, r = base - 1;
      if (len == 1) l = 1;
      for (int mask = 0; mask < (1 << base); mask++) {
        for (int digit = l; digit <= r; digit++) {
          dp[base][len][mask] += dp[base][len - 1][mask ^ (1 << digit)];
        }
      }
    }
  }
  int q;
  cin >> q;
  while (q--) {
    long long l, r;
    int base;
    cin >> base >> l >> r;
    cout << solve(r + 1, base) - solve(l, base) << "\n";
  }
  return 0;
}
