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;
using ll = long long;
vector<tuple<ll, ll, int>> qr[11];
ll dp[19][2][1 << 10];
ll ac[19][2][1 << 10][11];
int b;
ll go(int i, int dz, int mask) {
  if (i == 19) {
    if (mask == 0 && dz) return 1;
    return 0;
  }
  ll& ans = dp[i][dz][mask];
  if (ans != -1) return ans;
  ans = 0;
  for (int d = 0; d < b; d++) {
    int ndz = dz || d;
    int nmask = mask;
    if (ndz) nmask ^= (1 << d);
    ans += go(i + 1, ndz, nmask);
  }
  return ans;
}
int dig[19];
ll solve(int i, int dz, int mask) {
  ll ans = 0;
  if (i == 19) {
    if (mask == 0 && dz) return 1;
    return 0;
  }
  for (int d = 0; d < dig[i]; d++) {
    int ndz = dz || d;
    int nmask = mask;
    if (ndz) nmask ^= (1 << d);
    ans += go(i + 1, ndz, nmask);
  }
  int d = dig[i];
  int ndz = dz || d;
  int nmask = mask;
  if (ndz) nmask ^= 1 << d;
  return ans + solve(i + 1, ndz, nmask);
}
void write(ll x) {
  for (int i = 18; i >= 0; i--) {
    dig[i] = x % b;
    x /= b;
  }
}
ll resp[100010];
int main() {
  ios::sync_with_stdio(false);
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int b;
    ll l, r;
    cin >> b >> l >> r;
    qr[b].emplace_back(l, r, i);
  }
  for (b = 2; b <= 10; b++) {
    memset(dp, -1, sizeof dp);
    for (auto& p : qr[b]) {
      ll l, r;
      int id;
      tie(l, r, id) = p;
      write(r);
      ll ans = solve(0, 0, 0);
      write(l - 1);
      ans -= solve(0, 0, 0);
      resp[id] = ans;
    }
  }
  for (int i = 0; i < q; i++) {
    cout << resp[i] << "\n";
  }
  return 0;
}
