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 pos[100];
long long dp[100][11][11][100];
int tmp[11];
long long l, r;
int b;
long long dfs(int px, int pre, int limit, int k, int num) {
  if (px == 0) {
    if (k == 0) return 0;
    if (num != 0) return 0;
    return 1;
  }
  if (!limit && k != 0 && dp[px][b][pre][k] != -1) return dp[px][b][pre][k];
  int m = limit ? pos[px] : b - 1;
  long long ans = 0;
  for (int i = 0; i <= m; i++) {
    if (k == 0) {
      if (i == 0)
        ans += dfs(px - 1, pre, limit && i == m, 0, num);
      else {
        tmp[i]++;
        if (tmp[i] % 2 == 1)
          ans += dfs(px - 1, i, limit && i == m, k + 1, num + 1);
        else
          ans += dfs(px - 1, i, limit && i == m, k + 1, num - 1);
        tmp[i]--;
      }
    } else {
      tmp[i]++;
      if (tmp[i] % 2 == 1)
        ans += dfs(px - 1, i, limit && i == m, k + 1, num + 1);
      else
        ans += dfs(px - 1, i, limit && i == m, k + 1, num - 1);
      tmp[i]--;
    }
  }
  if (!limit && k != 0) dp[px][b][pre][k] = ans;
  return ans;
}
long long solve(long long x, int b) {
  if (x == 0) return 0;
  int k = 0;
  while (x) {
    pos[++k] = x % b;
    x /= b;
  }
  memset(tmp, 0, sizeof(tmp));
  return dfs(k, 0, 1, 0, 0);
}
int main() {
  memset(dp, -1, sizeof(dp));
  int q;
  scanf("%d", &q);
  while (q--) {
    scanf("%d %I64d %I64d", &b, &l, &r);
    printf("%I64d\n", solve(r, b) - solve(l - 1, b));
  }
  return 0;
}
