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 double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
long long dp[105][105][1048];
long long cnt[105];
int top[105];
long long b;
long long dfs(int pos, int state, int limit, int lead) {
  if (pos == -1) return state == 0;
  if (!limit && !lead && dp[b][pos][state] != -1) return dp[b][pos][state];
  int up = limit ? top[pos] : b - 1;
  long long ans = 0;
  for (int i = 0; i <= up; i++) {
    if (i == 0 && lead) {
      ans += dfs(pos - 1, state, limit && i == up, lead);
    } else {
      ans += dfs(pos - 1, state ^ cnt[i], limit && i == up, lead && i == 0);
    }
  }
  if (!limit && !lead) dp[b][pos][state] = ans;
  return ans;
}
long long solve(long long num) {
  int pos = 0;
  while (num) {
    top[pos++] = num % b;
    num /= b;
  }
  return dfs(pos - 1, 0, 1, 1);
}
int main() {
  int t;
  cin >> t;
  cnt[0] = 1;
  for (int i = 1; i <= 9; i++) cnt[i] = cnt[i - 1] * 2;
  memset(dp, -1, sizeof(dp));
  while (t--) {
    long long x, y;
    scanf("%lld%lld%lld", &b, &x, &y);
    printf("%lld\n", solve(y) - solve(x - 1));
  }
  return 0;
}
