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 b = 10;
const int maxl = 60;
const int maxn = 1 << 10;
long long dp[b + 2][maxl + 10][maxn + 100], cnt[b + 2][maxl + 100];
long long solve(int base, long long lmt) {
  vector<int> tmp;
  while (lmt) {
    tmp.push_back(lmt % base);
    lmt /= base;
  }
  reverse(tmp.begin(), tmp.end());
  int sz = tmp.size();
  long long ans = 0;
  if (sz) {
    ans += cnt[base][sz - 1];
  }
  long long mask = 0;
  for (int i = 0; i < sz; i++) {
    for (int j = 0; j < tmp[i]; j++) {
      if (i == 0 && j == 0) continue;
      ans += dp[base][sz - 1 - i][mask ^ (1 << j)];
    }
    mask ^= (1 << tmp[i]);
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  for (int i = 2; i <= b; i++) {
    dp[i][0][0] = 1;
    for (int j = 1; j <= maxl; j++) {
      for (int k = 0; k < (1 << i); k++) {
        for (int l = 0; l < i; l++) {
          dp[i][j][k] += dp[i][j - 1][k ^ (1 << l)];
        }
      }
      cnt[i][j] = cnt[i][j - 1];
      for (int k = 1; k < i; k++) {
        cnt[i][j] += dp[i][j - 1][1 << k];
      }
    }
  }
  int q;
  cin >> q;
  while (q--) {
    int base;
    long long l, r;
    cin >> base >> l >> r;
    long long ans = solve(base, r) - solve(base, l - 1);
    cout << ans << "\n";
  }
}
