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 double pi =
    3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int MR = 1 << 10;
string convert(long long x, int b) {
  string res = "";
  while (x) {
    res += x % b + '0';
    x /= b;
  }
  reverse(res.begin(), res.end());
  return res;
}
long long dp[70][MR];
int done[70][MR], akt;
long long go(const string &end, int pos, int mask, int b) {
  if (done[pos][mask] == akt)
    return dp[pos][mask];
  else
    dp[pos][mask] = 0;
  done[pos][mask] = akt;
  if (!pos) {
    if (mask & (mask - 1)) return 0;
    for (int j = (1); j <= (end[0] - '0'); ++j)
      if (mask & (1 << j)) return dp[pos][mask] = 1;
    return dp[pos][mask];
  }
  {
    int prevMask;
    if (mask & 1)
      prevMask = mask - 1;
    else
      prevMask = mask + 1;
    dp[pos][mask] += go(end, pos - 1, prevMask, b);
  }
  for (int j = (1); j <= (end[pos] - '0'); ++j) {
    int prevMask;
    if (mask & (1 << j))
      prevMask = mask - (1 << j);
    else
      prevMask = mask + (1 << j);
    dp[pos][mask] += go(end, pos - 1, prevMask, b);
    if (!prevMask) dp[pos][mask]++;
  }
  int pref = 0;
  for (int i = 0; i < (pos); ++i) pref ^= (1 << (end[i] - '0'));
  for (int j = (end[pos] - '0' + 1); j < (b); ++j) {
    int prevMask;
    if (mask & (1 << j))
      prevMask = mask - (1 << j);
    else
      prevMask = mask + (1 << j);
    dp[pos][mask] += go(end, pos - 1, prevMask, b);
    if (prevMask == pref) dp[pos][mask]--;
    if (!prevMask) dp[pos][mask]++;
  }
  return dp[pos][mask];
}
int main() {
  int q;
  scanf("%d", &q);
  for (int c = 0; c < (q); ++c) {
    akt = c + 1;
    int b;
    long long l, r;
    scanf("%d%lld%lld", &b, &l, &r);
    auto sl = convert(max(l - 1, 1LL), b), sr = convert(r, b);
    auto rV = go(sr, sr.length() - 1, 0, b);
    auto lV = go(sl, sl.length() - 1, 0, b);
    printf("%lld\n", rV - lV);
  }
  return 0;
}
