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;
const int MAXN = 5e4 + 5;
const long long mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
template <class T>
inline bool read(T &ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return 1;
}
int b, a[70];
long long l, r, dp[70][2500];
long long dfs(int pos, int sta, bool lead, bool limit) {
  if (pos == -1) {
    if (sta) return 0;
    return 1;
  }
  if (!limit && !lead && dp[pos][sta] != -1) return dp[pos][sta];
  int up = limit ? a[pos] : (b - 1);
  long long tmp = 0;
  for (int i = 0; i <= up; ++i) {
    if (lead && i == 0)
      tmp += dfs(pos - 1, sta, true, limit && a[pos] == i);
    else
      tmp += dfs(pos - 1, sta ^ (1 << i), false, limit && a[pos] == i);
  }
  if (!limit && !lead) dp[pos][sta] = tmp;
  return tmp;
}
long long solve(long long x) {
  int pos = 0;
  while (x) {
    a[pos++] = x % (long long)b;
    x /= (long long)b;
  }
  return dfs(pos - 1, 0, true, true);
}
int main() {
  int q;
  read(q);
  memset(dp, -1, sizeof(dp));
  while (q--) {
    read(b), read(l), read(r);
    printf("%lld\n", solve(r) - solve(l - 1));
  }
  return 0;
}
