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 MAX = 1000003;
const int MOD = 1000000007;
long long dp[11][(1 << 10)][65][2];
long long findLess(int base, int mask, int len, int zeroAllowed) {
  if (len == 0) {
    if (!mask) return 1;
    return 0;
  }
  if (dp[base][mask][len][zeroAllowed] != -1)
    return dp[base][mask][len][zeroAllowed];
  long long ans = 0;
  for (int i = 1; i < base; ++i) {
    ans += findLess(base, mask ^ (1 << i), len - 1, 1);
  }
  if (zeroAllowed) ans += findLess(base, mask ^ 1, len - 1, 1);
  dp[base][mask][len][zeroAllowed] = ans;
  return ans;
}
long long findAns(long long b, long long n) {
  vector<int> baseConv;
  long long m = n;
  while (m) {
    baseConv.push_back(m % b);
    m /= b;
  }
  long long res = 0;
  for (int i = 1; i < baseConv.size(); ++i) {
    res += findLess(b, 0, i, 0);
  }
  int mask = 0;
  for (int i = baseConv.size() - 1; i >= 0; --i) {
    for (int j = (i == baseConv.size() - 1); j < baseConv[i]; ++j) {
      res += findLess(b, mask ^ (1 << j), i, 1);
    }
    mask ^= (1 << baseConv[i]);
  }
  return res;
}
void solve() {
  memset(dp, -1, sizeof(dp));
  int q;
  cin >> q;
  while (q--) {
    long long b, l, r;
    cin >> b >> l >> r;
    long long ans = findAns(b, r) - findAns(b, l - 1);
    cout << ans << "\n";
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
