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 INF = (int)2e9 + 7;
const long double EPS = (long double)1e-5;
const int BASE = (int)1e9 + 7;
const int MAXN = 200500;
const long long INFLL = (long long)4e18;
long long f[11][70][1025];
int q;
vector<long long> a;
void ToVector(long long r, int b) {
  a.clear();
  while (r) a.push_back(r % b), r /= b;
  reverse(a.begin(), a.end());
}
void preCalc() {
  for (int b = 1; b <= 10; b++) {
    f[b][0][0] = 1ll;
    for (int i = 0; i < 65; i++) {
      for (int mask = 0; mask < (1 << b); mask++) {
        for (int newC = 0; newC < b; newC++) {
          f[b][i + 1][mask ^ (1 << newC)] += f[b][i][mask];
        }
      }
    }
  }
}
long long getCur(int mask, int len, int b) { return f[b][len][mask]; }
long long getAns(long long r, int b) {
  if (r == 0) return 0;
  ToVector(r, b);
  int n = (int)a.size();
  int curMask = 0;
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    for (int c = 0; c < b; c++) {
      if (c < a[i] && !(c == 0 && i == 0)) {
        ans += getCur(curMask ^ (1 << c), n - i - 1, b);
      }
      if (c != 0) {
        if (i == 0) {
          if (c < a[i]) ans += getCur((1 << c), n - i - 1, b);
        } else
          ans += getCur(1 << c, n - i - 1, b);
      }
    }
    curMask ^= (1 << a[i]);
  }
  return ans + (curMask == 0);
}
int main() {
  preCalc();
  scanf("%d", &q);
  while (q--) {
    long long b, l, r;
    cin >> b >> l >> r;
    long long ans = getAns(r, b) - getAns(l - 1, b);
    cout << ans << "\n";
  }
  return 0;
}
