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 inf = 1000000007;
const long long linf = 1ll * inf * inf;
const int M = 64;
const int multipleTest = 0;
long long dp[11][M][10][1 << 10];
long long cnt[11][M][1 << 10];
long long F[11][M];
void init() {
  for (int base = 2; base <= 10; ++base) {
    for (int st = (0), _b = (base); st < _b; ++st) {
      dp[base][1][st][1 << st] = 1;
      cnt[base][1][1 << st] = 1;
    }
    for (int len = 2; len < M; ++len) {
      for (int st = 0; st < base; ++st) {
        for (int mask = (0), _b = (1 << base); mask < _b; ++mask) {
          int curMask = mask ^ (1 << st);
          dp[base][len][st][curMask] += cnt[base][len - 1][mask];
        }
        for (int mask = (0), _b = (1 << base); mask < _b; ++mask)
          cnt[base][len][mask] += dp[base][len][st][mask];
      }
      for (int st = 1; st < base; ++st) F[base][len] += dp[base][len][st][0];
    }
  }
}
long long calc(int base, long long x) {
  if (x == 0) return 0;
  vector<int> tmp;
  while (x > 0) {
    tmp.push_back(x % base);
    x /= base;
  }
  reverse(tmp.begin(), tmp.end());
  int n = tmp.size();
  long long res = 0;
  for (int len = (1), _b = (n); len < _b; ++len) res += F[base][len];
  int curMask = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = (i == 0) ? 1 : 0; j < tmp[i]; ++j) {
      res += dp[base][n - i - 1][j][curMask ^ (1 << j)];
    }
    curMask ^= (1 << tmp[i]);
  }
  if (!curMask) ++res;
  return res;
}
void solve() {
  init();
  int q;
  cin >> q;
  while (q-- > 0) {
    int base;
    long long u, v;
    cin >> base >> u >> v;
    cout << calc(base, v) - calc(base, u - 1) << '\n';
  }
}
int main() {
  int Test = 1;
  if (multipleTest) {
    cin >> Test;
  }
  for (int i = 0; i < Test; ++i) {
    solve();
  }
}
