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 max_len = 10 * 6 + 1, max_base = 11, max_mask = (1 << 10) + 10;
long long dp[max_len][max_base][max_mask];
void prep() {
  for (int i = 0; i < max_len; i++) {
    for (int base = 2; base <= 10; base++) {
      for (int mask = 0; mask < (1 << base); mask++) {
        if (i == 0) {
          dp[i][base][mask] = (mask == 0);
          continue;
        }
        for (int j = 0; j < base; j++)
          dp[i][base][mask] += dp[i - 1][base][mask ^ (1 << j)];
      }
    }
  }
}
long long get(long long r, int base) {
  int cur = r;
  vector<int> v;
  while (cur) {
    v.push_back(cur % base);
    cur /= base;
  }
  reverse(v.begin(), v.end());
  int mask = 0, tot = (1 << base) - 1, n = v.size();
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < v[i]; j++) {
      int nmask = mask ^ (1 << j);
      if (i == 0 && j == 0) {
        for (int k = 1; k < n; k++)
          for (int dig = 1; dig < base; dig++) {
            ans += dp[n - k - 1][base][(1 << dig)];
          }
      } else
        ans += dp[n - i - 1][base][nmask];
    }
    mask ^= (1 << v[i]);
  }
  return ans;
}
int32_t main() {
  prep();
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int b;
    long long l, r;
    cin >> b >> l >> r;
    cout << get(r + 1, b) - get(l, b) << '\n';
  }
}
