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;
int n;
long long dp[11][64][1028];
int Dig[64];
int Nrdig(int b, long long x) {
  int nrd = 0;
  while (x) {
    ++nrd;
    x /= b;
  }
  return nrd;
}
void compDp() {
  for (int b = 2; b <= 10; ++b) {
    dp[b][0][0] = 1;
    int lmax = Nrdig(b, 1000000000000000000LL);
    for (int len = 1; len <= lmax; ++len)
      for (int mask = 0; mask < (1 << b); ++mask)
        for (int j = 0; j < b; ++j)
          if ((j + len) != 1)
            dp[b][len][mask] += dp[b][len - 1][mask ^ (1 << j)];
  }
}
long long Ans(int b, long long x) {
  if (x == 0) return 0;
  int nrd = Nrdig(b, x);
  long long ret = 0;
  for (int i = 1; i < nrd; ++i) ret += dp[b][i][0];
  int mask = 0;
  long long y = x;
  int idx = nrd;
  while (y) {
    Dig[idx--] = y % b;
    y /= b;
  }
  for (int p = 0; p < nrd; ++p) {
    for (int dig = 0; dig < Dig[p + 1]; ++dig)
      if (dig + p) ret += dp[b][nrd - p - 1][mask ^ (1 << dig)];
    mask ^= (1 << Dig[p + 1]);
  }
  if (mask == 0) ++ret;
  return ret;
}
int main() {
  scanf("%d", &n);
  compDp();
  while (n--) {
    int b;
    long long l, r;
    scanf("%d%lld%lld", &b, &l, &r);
    printf("%lld\n", Ans(b, r) - Ans(b, l - 1));
  }
  return 0;
}
