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 mod = 1000000007;
long long d[12][65][1024];
long long df[12][65];
long long f(int b, long long r) {
  int mask = 0;
  long long pw = 1, l = 0;
  while (pw <= r) {
    pw *= b;
    ++l;
    if (l == 18) {
      break;
    }
  }
  vector<int> a(l, 0);
  for (int i = 0; i < (int)(l); ++i) {
    a[l - i - 1] = r % b;
    r /= b;
  }
  long long ans = 0;
  for (int i = 0; i < (int)(l); ++i) {
    for (int dig = 0; dig < (int)(a[i]); ++dig) {
      if (dig == 0 && i == 0) {
        continue;
      }
      mask ^= 1 << dig;
      ans += d[b][l - i - 1][mask];
      mask ^= 1 << dig;
    }
    mask ^= 1 << a[i];
  }
  for (int i = 1; i < l; ++i) {
    for (int dig = 1; dig < b; ++dig) {
      ans += d[b][i - 1][1 << dig];
    }
  }
  return ans;
}
int main() {
  for (int b = 2; b <= 10; ++b) {
    d[b][0][0] = 1;
    for (int l = 1; l < 65; ++l) {
      for (int mask = 0; mask < (1 << b); ++mask) {
        for (int dig = 0; dig < (int)(b); ++dig) {
          d[b][l][mask] += d[b][l - 1][mask ^ (1 << dig)];
        }
      }
    }
  }
  ios::sync_with_stdio(false);
  int q;
  cin >> q;
  for (int i = 0; i < (int)(q); ++i) {
    int b;
    long long l, r;
    cin >> b >> l >> r;
    ++r;
    cout << f(b, r) - f(b, l) << endl;
  }
  return 0;
}
