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 = 11;
long long cnt[MAXN][65][1 << MAXN];
long long solve(int b, long long x) {
  if (x == 0) return 0;
  vector<int> d;
  while (x) {
    d.push_back(x % b);
    x /= b;
  }
  long long ans = 0;
  for (int i = (int)d.size() - 2; i >= 0; i--) {
    for (int j = 1; j < b; j++) ans += cnt[b][i][1 << j];
  }
  int now = 0;
  for (int i = d.size() - 1; i >= 0; i--) {
    for (int j = 1; j < d[i]; j++) ans += cnt[b][i][now ^ (1 << j)];
    now ^= (1 << d[i]);
  }
  if (now == 0) ans++;
  return ans;
}
int main() {
  for (int i = 2; i <= 10; i++) {
    cnt[i][0][0] = 1;
    for (int j = 1; j < 65; j++)
      for (int k = 0; k < (1 << i); k++) {
        for (int l = 0; l < i; l++) cnt[i][j][k] += cnt[i][j - 1][k ^ (1 << l)];
      }
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int b;
    long long l, r;
    scanf("%d%lld%lld", &b, &l, &r);
    printf("%lld\n", solve(b, r) - solve(b, l - 1));
  }
  return 0;
}
