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 nrq;
long long dp[11][20][1025][2][2];
int cif[20];
long long din(int b, int lung, int masca, int lzero, int egal) {
  if (lung == 0) {
    if ((masca == 0))
      return 1;
    else
      return 0;
  }
  if ((!egal) && (dp[b][lung][masca][lzero][egal] != -1))
    return dp[b][lung][masca][lzero][egal];
  int cifmax;
  if (egal)
    cifmax = cif[lung];
  else
    cifmax = b - 1;
  long long ans = 0;
  int newlzero, newegal, newmasca;
  for (int c = 0; c <= cifmax; c++) {
    if ((!lzero) || (c != 0))
      newmasca = masca ^ (1 << c);
    else
      newmasca = masca;
    if (lzero && (c == 0))
      newlzero = 1;
    else
      newlzero = 0;
    if (egal && (c == cif[lung]))
      newegal = 1;
    else
      newegal = 0;
    ans += din(b, lung - 1, newmasca, newlzero, newegal);
  }
  dp[b][lung][masca][lzero][egal] = ans;
  return ans;
}
long long solve(long long x, int b) {
  int lung = 0;
  while (x) {
    lung++;
    cif[lung] = x % b;
    x /= b;
  }
  return din(b, lung, 0, 1, 1);
}
int main() {
  long long b, l, r;
  memset(dp, -1, sizeof(dp));
  cin >> nrq;
  while (nrq--) {
    cin >> b >> l >> r;
    cout << solve(r, b) - solve(l - 1, b) << "\n";
  }
  return 0;
}
