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 mod = 1e9 + 7;
int m, a[70];
long long f[11][70][1 << 10];
long long get(int b, int len, int t, int k) {
  if (len == -1) return 0;
  if (k && f[b][len][t] != -1) return f[b][len][t];
  int j;
  long long ret = 0;
  if (k)
    j = b - 1;
  else
    j = a[len];
  for (int i = 0; i <= j; ++i)
    ret += get(b, len - 1, t ^ (1 << i), k | (i < j));
  if (k) f[b][len][t] = ret;
  return ret;
}
long long solve(long long n, int b) {
  long long ret = 0;
  if (!n) return 0;
  for (m = 0; n; a[m++] = n % b, n /= b)
    ;
  for (int i = 1; i <= a[m - 1]; ++i)
    ret += get(b, m - 2, 1 << i, i < a[m - 1]);
  for (int i = 1; i < m; ++i)
    for (int j = 1; j < b; ++j) ret += get(b, i - 2, 1 << j, 1);
  return ret;
}
int main() {
  memset(f, -1, sizeof(f));
  int Q, k;
  long long l, r;
  scanf("%d", &Q);
  while (Q--) {
    scanf("%d%I64d%I64d", &k, &l, &r);
    printf("%I64d\n", solve(r, k) - solve(l - 1, k));
  }
  return 0;
}
