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;
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
long long dp[75][12][3000];
void solvedp(long long step) {
  dp[0][step][0] = 1;
  for (long long i = 1; i < step; i++) dp[1][step][(1 << i)] = 1;
  for (long long i = 1; i < 70; i++)
    for (long long mask = 0; mask < (1 << step); mask++)
      for (long long now = 0; now < step; now++)
        dp[i + 1][step][mask ^ (1 << now)] += dp[i][step][mask];
}
vector<long long> parse(long long u, long long step) {
  vector<long long> res;
  while (u != 0) {
    res.push_back(u % step);
    u /= step;
  }
  reverse(res.begin(), res.end());
  return (res);
}
long long get(long long step, long long u) {
  vector<long long> vec = parse(u, step);
  long long ans = 0;
  long long mask = 0;
  for (long long i = 0; i < vec.size(); i++) {
    for (long long now = (i == 0); now < vec[i]; now++) {
      ans += dp[vec.size() - i - 1][step][mask ^ (1 << now)];
    }
    mask ^= (1 << vec[i]);
  }
  for (long long i = 0; i < vec.size(); i++) {
    ans += dp[i][step][0];
  }
  return (ans);
}
signed main() {
  for (long long i = 2; i <= 10; i++) solvedp(i);
  long long n;
  cin >> n;
  while (n--) {
    long long step, l, r;
    cin >> step >> l >> r;
    cout << get(step, r + 1) - get(step, l) << '\n';
  }
}
