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 INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int M = 1124;
const int B = 12;
const int N = 65;
long long int dp[B][N][M][2];
int up[N], q, b, l, r;
long long int f(int bs, int i, int msk, int fl, int poc, int gen) {
  if (i == -1) {
    return (msk == 0);
  }
  int lim = bs - 1;
  int ret = 0;
  if (fl) lim = up[i];
  for (int j = 0; j <= lim; j++) {
    int nf = fl;
    if (j < up[i]) nf = 0;
    ret += f(bs, i - 1, ((j | poc) ? (msk ^ (1 << j)) : msk), nf, j || poc,
             gen * b + j);
  }
  if (!fl) {
    dp[bs][i][msk][poc] = ret;
  }
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  memset(dp, -1, sizeof(dp));
  cin >> q;
  for (int i = 0; i < q; i++) {
    cin >> b >> l >> r;
    for (int j = 0; j < N; j++) {
      up[j] = int(r % (long long int)b);
      r /= (long long int)b;
    }
    int sol = f(b, N - 1, 0, 1, 0, 0);
    for (int j = 0; j < N; j++) {
      up[j] = int(l % (long long int)b);
      l /= (long long int)b;
    }
    sol -= f(b, N - 1, 0, 1, 0, 0);
    cout << sol << "\n";
  }
}
