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 long long INF = 1e18;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
inline int add(int x, int y) {
  x += y;
  if (x >= mod) x -= mod;
  return x;
}
inline int mul(int x, int y) {
  x = (1LL * x * y) % mod;
  return x;
}
long long dp[11][(1 << 10)][19];
long long f(int base, int mask, int len) {
  long long &ret = dp[base][mask][len];
  if (~ret) return ret;
  if (len == 0) {
    if (mask == 0) return 1;
    return 0;
  }
  ret = 0;
  for (int i = 0; i <= base - 1; ++i) {
    ret += f(base, mask ^ (1 << i), len - 1);
  }
  return ret;
}
long long fn(int base, long long x) {
  vector<int> xx;
  while (x) {
    xx.push_back(x % base);
    x /= base;
  }
  reverse(xx.begin(), xx.end());
  int n = (int)xx.size();
  long long ans = 0;
  for (int _n = 1; _n <= n - 1; ++_n) {
    ans += f(base, 0, _n) - f(base, 1, _n - 1);
  }
  int mask = 0;
  for (int i = 0; i <= n - 1; ++i) {
    int st = 0;
    if (i == 0) st = 1;
    for (int dig = st; dig <= xx[i] - 1; ++dig) {
      ans += f(base, mask ^ (1 << dig), n - i - 1);
    }
    mask ^= (1 << xx[i]);
  }
  ans += !mask;
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  memset(dp, -1, sizeof(dp));
  int q;
  cin >> q;
  while (q--) {
    int base;
    long long l, r;
    cin >> base >> l >> r;
    cout << fn(base, r) - fn(base, l - 1) << "\n";
  }
  return 0;
}
