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 MAX = 1LL << 62;
int n, b;
long long l, r;
long long f[10][70][1024];
long long g[10][70][1024];
long long base[10][70];
int digit[70];
void decomp(int b, long long x, int maxbit) {
  for (int i = maxbit - 1; i >= 0; i--) {
    digit[i + 1] = x / base[b][i];
    x %= base[b][i];
  }
}
long long get(int b, long long x) {
  if (x == 0) return 0;
  int maxbit = ceil(log(x) / log(b + 1));
  decomp(b, x, maxbit);
  long long ret = g[b][maxbit - 1][0];
  int s = 0;
  for (int i = maxbit; i >= 1; i--) {
    for (int k = (i == maxbit ? 1 : 0); k < digit[i]; k++)
      ret += f[b][i - 1][s ^ (1 << k)];
    s ^= (1 << digit[i]);
  }
  if (s == 0) ret++;
  return ret;
}
int main() {
  for (b = 1; b < 10; b++) {
    f[b][0][0] = 1;
    int maxbit = ceil(log(MAX) / log(b + 1));
    base[b][0] = 1;
    for (int i = 1; i <= maxbit; i++) {
      base[b][i] = base[b][i - 1] * (b + 1);
      for (int s = 0; s < (1 << (b + 1)); s++) {
        long long &x = f[b][i][s];
        long long &y = g[b][i][s];
        x = f[b][i - 1][s ^ 1];
        y = g[b][i - 1][s];
        for (int k = 1; k <= b; k++) {
          x += f[b][i - 1][s ^ (1 << k)];
          y += f[b][i - 1][s ^ (1 << k)];
        }
      }
    }
  }
  for (cin >> n; n--;) {
    cin >> b >> l >> r;
    long long ans = get(b - 1, r) - get(b - 1, l - 1);
    cout << ans << endl;
  }
}
