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;
using i64 = long long;
constexpr int MAX = 1024;
int digit[128];
i64 dp[12][128][MAX][2];
int DFS(int b, int p, int mask, bool zero, bool tag) {
  if (p == -1) return !zero && !mask;
  if (!tag && ~dp[b][p][mask][zero]) return dp[b][p][mask][zero];
  i64 ret = 0;
  int up = tag ? digit[p] : b - 1;
  for (int i = 0; i <= up; ++i) {
    int nxt = mask;
    if (!zero || i) nxt ^= (1 << i);
    i64 cur = DFS(b, p - 1, nxt, zero && !i, tag && i == up);
    ret += cur;
  }
  if (!tag) dp[b][p][mask][zero] = ret;
  return ret;
}
i64 Calc(i64 n, int b) {
  int p = 0;
  for (; n; n /= b) digit[p++] = n % b;
  return DFS(b, p - 1, 0, true, true);
}
int main() {
  memset(dp, -1, sizeof(dp));
  int q;
  while (cin >> q) {
    int b;
    i64 l, r;
    for (int i = 0; i < q; ++i) {
      cin >> b >> l >> r;
      i64 ll = Calc(l - 1, b);
      i64 rr = Calc(r, b);
      cout << rr - ll << endl;
    }
  }
  return 0;
}
