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 int i, n;
long long int dp[62][12][1 << 11][2][2];
vector<long long int> dig;
long long int solve(long long int idx, long long int base, long long int mask,
                    long long int tight, long long int lead) {
  if (idx == dig.size()) {
    return (!lead) & (mask == 0);
  }
  if (dp[idx][base][mask][tight][lead] != -1 && !lead) {
    return dp[idx][base][mask][tight][lead];
  }
  long long int ans = 0;
  if (tight) {
    for (long long int j = 0; j <= dig[idx]; j++) {
      if (j == 0) {
        if (lead)
          ans += solve(idx + 1, base, mask, 0, 1);
        else
          ans += solve(idx + 1, base, mask ^ (1 << j), 0, 0);
      } else if (j != dig[idx])
        ans += solve(idx + 1, base, mask ^ (1 << j), 0, 0);
      else
        ans += solve(idx + 1, base, mask ^ (1 << j), 1, 0);
    }
  } else {
    for (long long int j = 0; j <= base - 1; j++) {
      if (j == 0) {
        if (lead)
          ans += solve(idx + 1, base, mask, 0, 1);
        else
          ans += solve(idx + 1, base, mask ^ (1 << j), 0, 0);
      } else
        ans += solve(idx + 1, base, mask ^ (1 << j), 0, 0);
    }
  }
  return dp[idx][base][mask][tight][lead] = ans;
}
long long int go(long long int base, long long int n) {
  memset(dp, -1, sizeof(dp));
  dig.clear();
  if (n == 0) return 0;
  while (n != 0) {
    dig.push_back(n % base);
    n /= base;
  }
  reverse(dig.begin(), dig.end());
  return solve(0, base, 0, 1, 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long int q;
  cin >> q;
  while (q--) {
    long long int l, r, b;
    cin >> b >> l >> r;
    cout << go(b, r) - go(b, l - 1) << endl;
  }
  return 0;
}
