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;
template <typename G1, typename G2 = G1, typename G3 = G1>
struct triple {
  G1 first;
  G2 second;
  G3 T;
};
int main() {
  vector<vector<vector<vector<long long>>>> dp(
      1 << 10, vector<vector<vector<long long>>>(
                   65, vector<vector<long long>>(11, vector<long long>(2))));
  for (int i = 2; i < 11; i++) dp[0][0][i][1] = 1;
  for (int k = 2; k < 11; k++)
    for (int j = 1; j < 65; j++)
      for (int i = 0; i < (1 << 10); i++)
        for (int h = 0; h < 2; h++) {
          if (h == 0) dp[i][j][k][h] += dp[i][j - 1][k][h];
          for (int t = (h == 0); t < k; t++)
            dp[i][j][k][h] += dp[i ^ (1 << t)][j - 1][k][1];
        }
  auto query = [&](vector<int> v, int b) {
    int n = v.size();
    long long ans = dp[0][n - 1][b][0];
    int m = 0;
    for (int i = n; i > 0; i--) {
      for (int j = (i == n); j < v[i - 1]; j++)
        ans += dp[m ^ (1 << j)][i - 1][b][1];
      m ^= (1 << v[i - 1]);
    }
    return ans;
  };
  int q;
  cin >> q;
  while (q--) {
    int b, l, r;
    cin >> b >> l >> r;
    --l;
    vector<int> x, y;
    while (r > 0) x.push_back(r % b), r /= b;
    while (l > 0) y.push_back(l % b), l /= b;
    long long ans = query(x, b);
    if (!y.empty()) ans -= query(y, b);
    cout << ans << '\n';
  }
  return 0;
}
