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;
long long dp[11][63][1 << 11], ans[11][63];
void init() {
  for (int base = 2; base <= 10; base++) {
    dp[base][0][0] = 1;
    for (int len = 1; len <= 62; len++) {
      for (int s = 0; s < (1 << base); s++) {
        for (int x = len == 1 ? 1 : 0; x < base; x++) {
          dp[base][len][s] += dp[base][len - 1][s ^ (1 << x)];
        }
      }
      ans[base][len] = dp[base][len][0];
    }
  }
}
int toBase[63];
int change(long long x, int base) {
  int len = 0;
  while (x > 0) {
    toBase[len++] = x % base;
    x /= base;
  }
  return len;
}
void dfs(int pos, int s, bool ok, int base, int len, long long& ways) {
  if (pos < 0) {
    ways += (s == 0);
    return;
  }
  if (ok) {
    ways += dp[base][pos + 1][s];
    return;
  }
  dfs(pos - 1, s ^ (1 << toBase[pos]), ok, base, len, ways);
  for (int x = (pos == len - 1 ? 1 : 0); x < toBase[pos]; x++)
    dfs(pos - 1, s ^ (1 << x), true, base, len, ways);
}
long long solve(long long x, int base) {
  if (x == 0) return 0;
  long long res = 0;
  int len = change(x, base);
  for (int l = 1; l < len; l++) res += ans[base][l];
  dfs(len - 1, 0, false, base, len, res);
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  init();
  int q, b;
  long long l, r;
  cin >> q;
  while (q--) {
    cin >> b >> l >> r;
    cout << solve(r, b) - solve(l - 1, b) << '\n';
  }
  return 0;
}
