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;
long long dp[11][61][2][2][(1 << 10) + 10];
int arr[70];
int L;
int base;
long long solve(int pos, int ch, int st, int mask) {
  if (pos < 0) {
    if (st == 0) return 0;
    for (int i = 0; i < base; i++) {
      if (mask & (1 << i)) return 0;
    }
    return 1;
  }
  long long &ret = dp[base][pos][ch][st][mask];
  if (ret != -1) return ret;
  ret = 0;
  int limit = ch ? base - 1 : arr[pos];
  for (int j = 0; j <= limit; j++) {
    int t = ch ? 1 : j < limit;
    if (st == 0) {
      if (j == 0) continue;
    }
    ret += solve(pos - 1, t, 1, mask ^ (1 << j));
  }
  if (st == 0) ret += solve(pos - 1, 1, 0, 0);
  return ret;
}
long long process(long long val) {
  L = 0;
  while (val > 0) {
    arr[L++] = val % base;
    val /= base;
  }
  return solve(L - 1, 0, 0, 0);
}
int main() {
  memset(dp, -1, sizeof dp);
  int q;
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &base);
    long long l, r;
    scanf("%lld %lld", &l, &r);
    if (l > r) swap(l, r);
    long long res = process(r) - process(l - 1);
    printf("%lld\n", res);
  }
}
