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 MAXN = 100 + 10;
int a[MAXN], dp[11][MAXN][1 << 10];
void Init() {
  for (int b = 2; b <= 10; ++b) {
    dp[b][0][0] = 1;
    for (int i = 1; i <= 100; ++i) {
      for (int x = 0; x < 1 << b; ++x) {
        for (int d = 0; d < b; ++d) {
          int px = x ^ (1 << d);
          dp[b][i][x] += dp[b][i - 1][px];
        }
      }
    }
  }
}
long long Count(long long N, int b) {
  int n = 0;
  while (N) {
    a[++n] = N % b;
    N /= b;
  }
  reverse(a + 1, a + 1 + n);
  long long ans = 0, cur = 0;
  for (int i = 1; i <= n - 1; ++i) ans += dp[b][i][0] - dp[b][i - 1][1];
  for (int i = 1; i <= n; ++i) {
    for (int d = (i == 1) ? 1 : 0; d < a[i]; ++d) {
      int pcur = cur ^ (1 << d);
      ans += dp[b][n - i][pcur];
    }
    cur ^= (1 << a[i]);
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int TC;
  cin >> TC;
  Init();
  while (TC--) {
    int b;
    cin >> b;
    long long l, r;
    cin >> l >> r;
    cout << Count(r + 1, b) - Count(l, b) << "\n";
  }
  return 0;
}
