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 b, dp[11][61][1025], digit[69];
long long f(long long pos, long long mask, bool check, bool zero) {
  if (pos == 0)
    if (zero == 0)
      return (mask == 0);
    else
      return 0;
  if (check == 0 && zero == 0 && dp[b][pos][mask] != -1)
    return dp[b][pos][mask];
  long long res = 0, n = check ? digit[pos] : b - 1;
  for (long long i = 0; i <= n; i++) {
    res += f(pos - 1, (zero == 1 && i == 0) ? mask : mask ^ (1 << i),
             (check == 1 && i == n) ? 1 : 0, (zero == 1 && i == 0) ? 1 : 0);
  }
  if (check == 0 && zero == 0) return dp[b][pos][mask] = res;
  return res;
}
long long get(long long r) {
  long long cnt = 0, ans = 0;
  while (r) {
    digit[cnt++] = r % b;
    r /= b;
  }
  ans = f(cnt, 0, 1, 1);
  return ans;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  memset(dp, -1, sizeof dp);
  long long q;
  cin >> q;
  while (q--) {
    long long l, r;
    cin >> b >> l >> r;
    cout << get(r) - get(l - 1) << endl;
  }
}
