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;
struct query {
  long long b, l, r, id;
} q[100010];
int n, b, now, num[100];
long long dp[100][1100], ans[100010];
int check(int x) {
  int res = 0;
  while (x) {
    if (x & 1) res++;
    x >>= 1;
  }
  return res;
}
long long dfs(int len, int status, bool lim) {
  if (len < 1) return status == 0;
  if ((len & 1) && status == 0) return 0;
  int times = check(status);
  if (times > len) return 0;
  if (times == len) return 1;
  if (dp[len][status] && !lim && len != now) return dp[len][status];
  int up = lim ? num[len] : b - 1;
  long long res = 0;
  for (int i = 0; i <= up; i++) {
    if (len == now && i == 0) continue;
    res += dfs(len - 1, status ^ (1 << i), lim && i == up);
  }
  if (!lim && len != now) dp[len][status] = res;
  return res;
}
long long cal(long long x) {
  int tot = 0;
  while (x) {
    num[++tot] = x % b;
    x /= b;
  }
  long long res = 0;
  for (now = 1; now <= tot; now++) res += dfs(now, 0, now == tot);
  return res;
}
bool cmp(query a, query b) { return a.b < b.b; }
int main() {
  int m;
  cin >> m;
  for (int i = 1; i <= m; i++) {
    long long l, r;
    scanf("%I64d%I64d%I64d", &q[i].b, &q[i].l, &q[i].r);
    q[i].id = i;
  }
  sort(q + 1, q + 1 + m, cmp);
  for (int i = 1; i <= m; i++) {
    if (q[i].b != q[i - 1].b) {
      memset(dp, 0, sizeof(dp));
      b = q[i].b;
    }
    ans[q[i].id] = cal(q[i].r) - cal(q[i].l - 1);
  }
  for (int i = 1; i <= m; i++) printf("%I64d\n", ans[i]);
  return 0;
}
