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 dp[11][63][1025][2];
bool vis[11][63][1025][2];
inline int DP(int bit, int p, int s, bool zero_allow) {
  if (p == 0) return s == 0;
  if (vis[bit][p][s][zero_allow]) return dp[bit][p][s][zero_allow];
  vis[bit][p][s][zero_allow] = 1;
  int lower = 1;
  if (zero_allow) lower = 0;
  for (int i = lower; i < bit; i++)
    dp[bit][p][s][zero_allow] += DP(bit, p - 1, (s ^ (1 << i)), 1);
  return dp[bit][p][s][zero_allow];
}
inline long long solve(long long x, int b) {
  int tab[60], tot = 0;
  while (x) {
    tab[++tot] = x % (long long)b;
    x /= (long long)b;
  }
  int state = 0, tmp;
  long long ans = 0;
  for (int i = tot; i >= 1; i--) {
    if (i == tot)
      tmp = 1;
    else
      tmp = 0;
    for (int j = tmp; j < tab[i]; j++) ans += DP(b, i - 1, state ^ (1 << j), 1);
    state ^= 1 << tab[i];
    ans += DP(b, i - 1, 0, 0);
  }
  if (!state) ans++;
  return ans;
}
int main() {
  int T, b;
  long long l, r;
  scanf("%d", &T);
  while (T--) {
    scanf("%d%lld%lld", &b, &l, &r);
    printf("%lld\n", solve(r, b) - solve(l - 1, b));
  }
  return 0;
}
