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 B = 11;
const int N = 61;
const long long inf = 1e18;
long long dp[B][N][1 << (B - 1)];
void pre() {
  for (int b = 2; b < B; ++b) {
    unsigned long long h = 1;
    dp[b][0][0] = 1;
    for (int w = 1; h <= inf; ++w, h *= b) {
      for (int s = 0; s < (1 << b); ++s) {
        for (int d = 0; d < b; ++d) {
          dp[b][w][s] += dp[b][w - 1][1 << d ^ s];
        }
      }
    }
  }
}
long long calc(int b, long long v) {
  if (!v) return 0;
  string u;
  for (; v; v /= b) u += char(v % b);
  reverse(begin(u), end(u));
  long long ans = 0;
  for (int i = 2; i < ((int)((u).size())); i += 2)
    ans += dp[b][i][0] - dp[b][i - 1][1];
  int s = 0;
  for (int i = 0; i < ((int)((u).size())); ++i) {
    for (int j = !i; j < u[i]; ++j)
      ans += dp[b][((int)((u).size())) - i - 1][1 << j ^ s];
    s ^= 1 << u[i];
  }
  return ans;
}
int main() {
  pre();
  ios::sync_with_stdio(0);
  cin.tie(0);
  int q;
  cin >> q;
  while (q--) {
    int b;
    long long l, r;
    cin >> b >> l >> r;
    cout << calc(b, r) - calc(b, l - 1) << '\n';
  }
}
