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;
struct FastIO {
  inline FastIO& operator>>(int& x) {
    x = 0;
    char f = 0, ch = getchar();
    while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
    while (ch <= '9' && ch >= '0') x = x * 10 + ch - 48, ch = getchar();
    return x = (f ? -x : x), *this;
  }
  inline FastIO& operator>>(long long& x) {
    x = 0;
    char f = 0, ch = getchar();
    while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
    while (ch <= '9' && ch >= '0') x = x * 10 + ch - 48, ch = getchar();
    return x = (f ? -x : x), *this;
  }
  inline FastIO& operator>>(double& x) {
    x = 0;
    char f = 0, ch = getchar();
    double d = 0.1;
    while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
    while (ch <= '9' && ch >= '0') x = x * 10 + ch - 48, ch = getchar();
    if (ch == '.') {
      ch = getchar();
      while (ch <= '9' && ch >= '0')
        x += d * (ch ^ 48), d *= 0.1, ch = getchar();
    }
    return x = (f ? -x : x), *this;
  }
} rin;
int f[11][65][2055];
int num[100];
long long b, l, r;
long long dfs(int jz, int len, int now, bool zer, bool up) {
  if (len == 0) return now == 0;
  if ((zer == 0) && (up == 0) && (f[jz][len][now] != -1))
    return f[jz][len][now];
  int limt = up ? num[len] : jz - 1;
  long long ret = 0;
  for (int i = 0; i <= limt; ++i) {
    if (zer && i == 0)
      ret += dfs(jz, len - 1, now, 1, up && (i == limt));
    else
      ret += dfs(jz, len - 1, now ^ (1 << i), 0, up && (i == limt));
  }
  if (up == 0 && zer == 0) f[jz][len][now] = ret;
  return ret;
}
long long solve(long long x) {
  int len = 0;
  while (x) {
    num[++len] = x % b;
    x /= b;
  }
  return dfs(b, len, 0, 1, 1);
}
int main() {
  memset(f, -1, sizeof f);
  int q;
  rin >> q;
  while (q--) {
    rin >> b >> l >> r;
    printf("%I64d\n", solve(r) - solve(l - 1));
  }
}
