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 dp[12][20][20];
int a[20];
int b;
int check(int sta) {
  int f = 0;
  for (int i = 1; i <= b; ++i) {
    if (sta & 1) f++;
    sta >>= 1;
  }
  return f;
}
long long dfs(int pos, int sta, bool zero, bool limit) {
  if (pos == 0) {
    return !sta;
  }
  if (!limit && !zero && dp[b][pos][sta] != -1) return dp[b][pos][sta];
  int up = limit ? a[pos] : b - 1;
  long long tmp = 0;
  for (int i = 0; i <= up; i++) {
    if (zero && i == 0) {
      if (check(sta) > pos - 1) continue;
      tmp += dfs(pos - 1, sta, 1, limit && i == a[pos]);
    } else {
      if (check(sta ^ (1 << i)) > pos - 1) continue;
      tmp += dfs(pos - 1, sta ^ (1 << i), 0, limit && i == a[pos]);
    }
  }
  if (!limit && !zero) dp[b][pos][sta] = tmp;
  return tmp;
}
int solve(long long k) {
  int pos = 0;
  while (k > 0) {
    a[++pos] = k % b;
    k /= b;
  }
  return dfs(pos, 0, true, true);
}
int main(void) {
  long long le, ri;
  memset(dp, -1, sizeof dp);
  int n;
  scanf("%d", &n);
  while (n--) {
    scanf("%d%I64d%I64d", &b, &le, &ri);
    printf("%d\n", solve(ri) - solve(le - 1));
  }
  return 0;
}
