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 MX = (1 << 10);
const int LOG = 65;
const int BASE = 10 + 2;
long long t, b, l, r, len;
long long dp[BASE][MX][LOG];
long long solve(int base, int mask, int idx) {
  if (idx < 0) return 0;
  if (idx == 0) return (mask == 0);
  if (dp[base][mask][idx] != -1) return dp[base][mask][idx];
  long long ret = 0;
  for (int i = 0; i < base; i++) {
    int nmask = mask ^ (1 << i);
    ret += solve(base, nmask, idx - 1);
  }
  return dp[base][mask][idx] = ret;
}
string toString(int x, int b) {
  string ret;
  for (int i = x; i > 0; i /= b) {
    ret = char(i % b + '0') + ret;
  }
  return ret;
}
long long pref(long long x) {
  string num = toString(x, b);
  long long ret = 0;
  int mask_so_far = 0;
  for (int i = 0; i < num.size(); i++) {
    for (int j = 0; j < num[i] - '0'; j++) {
      if (i == 0 && j == 0) continue;
      int cur_mask = mask_so_far ^ (1 << j);
      ret += solve(b, cur_mask, num.size() - i - 1);
    }
    if (i > 0)
      for (int j = 1; j <= 9; ++j) {
        int cur_mask = (1 << j);
        ret += solve(b, cur_mask, num.size() - i - 1);
      }
    mask_so_far ^= (1 << (num[i] - '0'));
  }
  ret += solve(b, mask_so_far, 0);
  return ret;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  memset(dp, -1, sizeof(dp));
  while (t--) {
    cin >> b >> l >> r;
    cout << pref(r) - pref(l - 1) << '\n';
  }
  return 0;
}
