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;
int n, m, num[66], dp[66][66][1025];
int d(int cnt, int sum, int pos, int st, bool pre, bool limi) {
  if (pos == -1) return sum == 0;
  if (!pre && !limi && dp[cnt][pos][sum] != -1) return dp[cnt][pos][sum];
  int up = limi ? num[pos] : cnt - 1;
  int summ = 0;
  for (int i = 0; i <= up; ++i) {
    int M;
    if (pre && i == 0)
      M = sum;
    else
      M = sum ^ (1LL << i);
    summ += d(cnt, M, pos - 1, i, pre && i == 0, limi && i == up);
  }
  if (!pre && !limi) dp[cnt][pos][sum] = summ;
  return summ;
}
int f(int cnt, int x) {
  int pos = 0;
  while (x) {
    num[pos++] = x % cnt;
    x /= cnt;
  }
  num[pos] = 0;
  return d(cnt, 0, pos - 1, 0, true, true);
}
int main() {
  memset(dp, -1, sizeof(dp));
  int t, x, l, r;
  scanf("%d", &t);
  while (t--) {
    scanf("%d%d%d", &x, &l, &r);
    printf("%d\n", f(x, r) - f(x, l - 1));
  }
  return 0;
}
