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;
int bitcnt(int a) {
  int i = 0;
  while (a) a -= ((a) & (-(a))), ++i;
  return i;
}
int upper[20];
long long dp[11][20][1 << 10][10];
long long dfs(int b, int pos, int limit, int lead, int last, int state,
              int Now) {
  if (!pos) {
    return state == 0;
  }
  if (!limit && !lead && ~dp[b][pos][state][last])
    return dp[b][pos][state][last];
  long long res = 0;
  for (int i = 0; i < b; ++i) {
    if (limit && i > upper[pos]) break;
    res += dfs(b, pos - 1, limit && i == upper[pos], lead && !i, i,
               state ^ ((!(lead && !i)) << i), Now * 10 + i);
  }
  if (!limit && !lead) dp[b][pos][state][last] = res;
  return res;
}
long long solve(long long x, int b) {
  long long i = 0, cp = x;
  while (cp) {
    upper[++i] = cp % b;
    cp /= b;
  }
  return dfs(b, i, 1, 1, 0, 0, 0);
}
int main() {
  int q;
  cin >> q;
  memset(dp, -1, sizeof dp);
  while (q--) {
    long long l, r, b;
    cin >> b >> l >> r;
    cout << solve(r, b) - solve(l - 1, b) << endl;
  }
}
