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>
#pragma GCC optimize(2)
#pragma G++ optimize(2)
#pragma GCC optimize(3)
#pragma G++ optimize(3)
using namespace std;
void read(long long &x) {
  x = 0;
  long long f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -f;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + c - '0';
    c = getchar();
  }
  x *= f;
  return;
}
void print(long long x) {
  if (x < 10ll) {
    putchar(x + '0');
    return;
  }
  print(x / 10ll);
  putchar(x % 10ll + '0');
}
void write(long long x) { print(x < 0ll ? -x : x); }
long long maxt(long long a, long long b) { return a > b ? a : b; }
long long mint(long long a, long long b) { return a < b ? a : b; }
long long q, b, l, r, cnt[64], ttmp, qt[11], pret[11][64],
    dp[64][1 << 10][2][2];
long long dfs(long long len, long long s, bool sx, bool qd) {
  if (!len) return s ? 0 : 1;
  if (~dp[len][s][sx][qd] && sx == 1 && qd == 1) return dp[len][s][sx][qd];
  dp[len][s][sx][qd] = 0;
  long long up = sx ? b - 1 : cnt[len];
  for (int i = 0; i <= up; i++)
    dp[len][s][sx][qd] += dfs(len - 1, (!qd && !i) ? s : s ^ (1 << i),
                              sx | (i < up), qd | (i != 0));
  return dp[len][s][sx][qd];
}
long long solve(long long x) {
  memset(cnt, 0, sizeof(cnt));
  long long tmp = x;
  long long len = 0;
  for (int i = qt[b]; i >= 0; i--)
    if (tmp / pret[b][i] && tmp / pret[b][i] < b) {
      cnt[i + 1] = tmp / pret[b][i];
      tmp -= cnt[i + 1] * pret[b][i];
      if (!len) len = i + 1;
    }
  if (!len) len = 1;
  return dfs(len, 0ll, 0, 0);
}
int main() {
  read(q);
  memset(dp, -1, sizeof(dp));
  for (int i = 2; i <= 10; i++) {
    long long ptmp = 1e18;
    pret[i][0] = 1;
    while (ptmp) {
      ptmp /= i;
      qt[i]++;
      pret[i][qt[i]] = pret[i][qt[i] - 1] * i;
    }
  }
  while (q--) {
    read(b), read(l), read(r);
    write(solve(r) - solve(l - 1));
    putchar('\n');
  }
}
