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;
int b;
long long l, r;
vector<int> v;
long long dp[11][66][(1 << 11) + 2][2];
long long solve2(int idx, int base, int L, int msk, int flag) {
  if (idx == v.size()) return msk == 0;
  long long ret = dp[base][L][msk][flag];
  if (~ret) return ret;
  ret = solve2(idx + 1, base, L - 1, msk ^ flag, flag);
  for (int i = 1; i < b; i++) {
    ret += solve2(idx + 1, base, L - 1, msk ^ (1 << i), (flag | i));
  }
  return ret;
}
long long solve(int idx, int base, int L, int msk, int flag) {
  if (idx == v.size()) return msk == 0;
  long long ret = 0;
  for (int i = 0; i <= v[idx]; i++) {
    if (i == v[idx])
      ret += solve(idx + 1, base, L - 1, msk ^ (1 << i), (flag | i));
    else {
      if (i || flag)
        ret += solve2(idx + 1, base, L - 1, msk ^ (1 << i), (flag | i));
      else
        ret += solve2(idx + 1, base, L - 1, msk, flag);
    }
  }
  return ret;
}
long long getAns(long long x) {
  v.clear();
  while (x) {
    v.push_back(x % b);
    x /= b;
  }
  reverse(v.begin(), v.end());
  return solve(0, b, v.size(), 0, 0);
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  memset(dp, -1, sizeof dp);
  int q;
  cin >> q;
  while (q--) {
    cin >> b >> l >> r;
    cout << getAns(r) - getAns(l - 1) << "\n";
  }
}
