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 a[150], f[15][70][2500];
long long b;
long long dfs(int len, int now, int lead, int less) {
  if (len == -1) return (now == (1 << b) - 1) ? 1 : 0;
  if (!less && !lead && f[b][len][now] != -1) return f[b][len][now];
  long long ed = !less ? b - 1 : a[len];
  long long ret = 0;
  for (int i = 0; i <= ed; i++)
    ret += dfs(len - 1, (lead && i == 0) ? now : (1 << i) ^ now,
               lead && (i == 0), less && (i == ed));
  if (!less && !lead) f[b][len][now] = ret;
  return ret;
}
long long solve(long long x) {
  int len = 0;
  while (x) {
    a[len++] = x % b;
    x /= b;
  }
  return dfs(len - 1, (1 << b) - 1, 1, 1);
}
int main() {
  long long q;
  memset(f, -1, sizeof(f));
  cin >> q;
  while (q--) {
    long long l, r;
    cin >> b >> l >> r;
    cout << solve(r) - solve(l - 1) << endl;
  }
  return 0;
}
