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;
template <typename T>
void read(T &x) {
  int f = 1;
  x = 0;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -f;
  for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
  x = x * f;
}
const int N = 30;
const int S = 1 << 10;
const int M = 10;
long long Q, b, n, m, s, len, ans;
long long a[N], dp[N][M];
long long dfs(long long pos, long long lim, long long lead, long long S) {
  if (pos == 0) return S == 0;
  if (dp[pos][S] != -1 && (!lim) && (!lead)) return dp[pos][S];
  long long up = lim ? a[pos] : (b - 1), ret = 0;
  for (int i = 0; i <= up; ++i) {
    if (lead && i == 0)
      ret += dfs(pos - 1, 0, 1, 0);
    else
      ret += dfs(pos - 1, lim && i == up, lead && i == 0, S ^ (1 << i));
  }
  if ((!lim) && (!lead)) dp[pos][S] = ret;
  return ret;
}
long long part(long long x) {
  if (!x) return 1;
  len = 0;
  while (x) {
    a[++len] = x % b;
    x = x / b;
  }
  memset(dp, -1, sizeof(dp));
  return dfs(len, 1, 1, 0);
}
void solve() {
  scanf("%lld", &Q);
  while (Q--) {
    scanf("%lld%lld%lld", &b, &n, &m);
    ans = part(m) - part(n - 1);
    printf("%lld\n", ans);
  }
}
int main() {
  solve();
  return 0;
}
