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;
long long read() {
  long long x;
  cin >> x;
  return x;
}
long long dp[10][80][1 << 10];
long long stk[80], top;
long long B;
long long dfs(long long nw, long long lim, long long S, long long zero) {
  if (dp[B][nw][S] != -1 && !zero && !lim) return dp[B][nw][S];
  if (nw == 0) {
    return S == 0;
  }
  long long up = lim ? stk[nw] : B - 1;
  long long ans = 0;
  for (long long i = 0; i <= up; i++) {
    if (i == 0) {
      if (zero)
        ans += dfs(nw - 1, 0, 0, 1);
      else
        ans += dfs(nw - 1, lim && (i == up), S ^ (1 << i), 0);
      continue;
    }
    ans += dfs(nw - 1, lim && (i == up), S ^ (1 << i), 0);
  }
  if (!zero && !lim) dp[B][nw][S] = ans;
  return ans;
}
long long calc(long long b, long long val) {
  top = 0;
  while (val) {
    stk[++top] = val % b;
    val /= b;
  }
  B = b;
  return dfs(top, 1, 0, 1);
}
void solve() {
  long long b = read(), l = read(), r = read();
  cout << calc(b, r) - calc(b, l - 1) << endl;
}
signed main() {
  ios ::sync_with_stdio(0);
  memset(dp, -1, sizeof(dp));
  long long Case = read();
  while (Case--) solve();
  return 0;
}
