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 = (int)1e5 + 10;
const int INF = 1e9;
const int MOD = 1000000007;
long long dp[11][64][1 << 10];
int bits[1 << 10], b;
string c;
string conv(long long n, int b) {
  string r = "";
  while (n > 0) {
    r += (char)(n % b + '0');
    n /= b;
  }
  return r;
}
long long go(int pos, int msk) {
  if (pos == -1) {
    return msk == 0;
  }
  if (dp[b][pos][msk] != -1) {
    return dp[b][pos][msk];
  }
  if (bits[msk] > pos + 1) {
    return 0;
  }
  long long &ret = (dp[b][pos][msk] = 0);
  for (int i = 0; i < b; ++i) {
    ret += go(pos - 1, msk ^ (1 << i));
  }
  return ret;
}
long long get(int b, long long n) {
  c = conv(n, b);
  long long ans = 0;
  int msk = 0;
  for (int j = (int)c.length() - 1; j >= 0; --j) {
    int st = j == (int)c.length() - 1;
    for (int d = st; d < c[j] - '0'; ++d) {
      ans += go(j - 1, msk ^ (1 << d));
    }
    if (st == 1) {
      for (int p = 0; p < j; ++p) {
        for (int d = 1; d < b; ++d) {
          ans += go(p - 1, 1 << d);
        }
      }
    }
    msk ^= 1 << (c[j] - '0');
  }
  return ans;
}
int main() {
  int q;
  cin >> q;
  for (int i = 1; i < 1024; ++i) {
    bits[i] = bits[i / 2] + (i % 2);
  }
  memset(dp, -1, sizeof(dp));
  while (q--) {
    long long l, r;
    scanf("%d%I64d%I64d", &b, &l, &r);
    printf("%I64d\n", get(b, r) - get(b, l - 1));
  }
  return 0;
}
