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 int B = 11;
const int N = 70;
long long memo[N][B];
int base;
long long l, r;
long long solve(int n, int odd) {
  if (odd > base) {
    return 0;
  }
  if (odd < 0) {
    return 0;
  }
  if (n == 0) {
    return odd == 0;
  }
  long long& res = memo[n][odd];
  if (res != -1) return res;
  res = odd * solve(n - 1, odd - 1);
  res += (base - odd) * solve(n - 1, odd + 1);
  return res;
}
long long solve(long long mx) {
  if (mx == 0) return 0;
  memset(memo, -1, sizeof memo);
  vector<int> digits;
  while (mx != 0) {
    digits.push_back(mx % base);
    mx /= base;
  }
  long long res = 0;
  for (int i = 1; i < digits.size(); ++i) {
    for (int d = 1; d < base; ++d) {
      res += solve(digits.size() - i - 1, 1);
    }
  }
  int odd = 0;
  bool first = true;
  while (!digits.empty()) {
    for (int i = first; i < digits.back(); ++i) {
      int tmp = odd;
      tmp ^= (1 << i);
      res += solve(digits.size() - 1, (__builtin_popcountll(tmp)));
    }
    odd ^= (1 << digits.back());
    digits.pop_back();
    first = false;
  }
  res += ((__builtin_popcountll(odd)) == 0);
  return res;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int q;
  cin >> q;
  while (q--) {
    cin >> base >> l >> r;
    cout << solve(r) - solve(l - 1) << '\n';
  }
}
