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 long long N = 1 << 12, B = 11, L = 30;
long long dp[B][L][N];
long long get(long long x, long long b) {
  vector<long long> s;
  do {
    s.push_back(x % b);
    x /= b;
  } while (x > 0);
  reverse(s.begin(), s.end());
  long long ans = 0;
  for (long long i = 1; i < long long(s.size()); i++) {
    ans += dp[b][i][0] - dp[b][i - 1][1];
  }
  long long mask = 0;
  long long sz = s.size();
  for (long long i = 0; i < sz; i++) {
    for (long long j = 0; j < s[i]; j++) {
      if (j == 0 && i == 0) {
        continue;
      }
      ans += dp[b][sz - i - 1][mask ^ (1 << j)];
    }
    mask ^= (1 << s[i]);
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  double ttime = clock();
  for (long long b = 2; b <= 10; b++) {
    dp[b][0][0] = 1;
    for (long long i = 1; i < L; i++) {
      for (long long mask = 0; mask < (1 << b); mask++) {
        for (long long last = 0; last < b; last++) {
          dp[b][i][mask] += dp[b][i - 1][mask ^ (1 << last)];
        }
      }
    }
  }
  cerr << (clock() - ttime) / CLOCKS_PER_SEC << '\n';
  long long q;
  for (cin >> q; q; q--) {
    long long b;
    long long l, r;
    cin >> b >> l >> r;
    cout << get(r + 1, b) - get(l, b) << '\n';
  }
  return 0;
}
