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 maxn = (int)(65);
int q, b, n;
long long a[maxn], dp[65][10][(1 << 10)];
string t;
inline long long calc(int v, int len, int mask) {
  if (v == n) {
    return !mask;
  }
  long long &res = dp[len][b][mask];
  if (res != -1) return res;
  res = 0;
  for (int i = (v == 0); i < b; ++i) {
    res += calc(v + 1, len - 1, mask ^ (1 << i));
  }
  return res;
}
inline long long get(long long r) {
  if (!r) return 0;
  t = "";
  int mask = 0;
  long long x = r;
  while (x) {
    t += char(x % b + '0');
    mask ^= (1 << (x % b));
    x /= b;
  }
  reverse(t.begin(), t.end());
  long long res = int(!mask);
  int m = t.size();
  n = m - 1;
  for (n; n > 0; --n) {
    res += calc(0, n, 0);
  }
  mask = 0;
  for (int i = 0; i < m; ++i) {
    int x = t[i] - '0';
    for (int j = (i == 0); j < x; ++j) {
      n = m - 1 - i;
      res += calc(0, n, mask ^ (1 << j));
    }
    mask ^= (1 << x);
  }
  return res;
}
int main() {
  memset(dp, -1, sizeof dp);
  ios_base ::sync_with_stdio(NULL);
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    long long l, r;
    cin >> b >> l >> r;
    cout << get(r) - get(l - 1) << endl;
  }
}
