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 dp[11][1 << 11][105];
int tmp[81];
long long solve(long long base, long long val) {
  if (val <= 0LL) return 0;
  long long ans = 0, up = 1;
  for (int i = 1;; i++) {
    up = up * base;
    if (val >= up) {
      for (int x = 1; x < base; x++) {
        ans += dp[base][1 << x][i - 1];
      }
    } else {
      int v[100], n = 0;
      while (val) {
        v[i - n] = val % base;
        n++;
        val /= base;
      }
      int premask = 0;
      for (int j = 0; j <= i; j++) {
        if (j == i) {
          ans += !premask;
          return ans;
        }
        for (int x = ((j == 0) ? 1 : 0); x < v[j + 1]; x++) {
          ans += dp[base][premask ^ (1 << x)][i - j - 1];
        }
        premask ^= (1 << v[j + 1]);
      }
    }
  }
  return ans;
}
int main(void) {
  int q;
  scanf("%d", &q);
  dp[0][0][0] = 1;
  for (int i = 2; i <= 10; i++) {
    dp[i][0][0] = 1;
    for (int j = 0; j < 100; j++) {
      for (int k = 0; k < (1 << i); k++) {
        if (dp[i][k][j] > 0) {
          for (int l = 0; l < i; l++) {
            dp[i][k ^ (1 << l)][j + 1] += dp[i][k][j];
          }
        }
      }
    }
  }
  for (int i = 0; i < q; i++) {
    int b;
    long long l, r;
    scanf("%d%lld%lld", &b, &l, &r);
    printf("%lld\n", solve(b, r) - solve(b, l - 1LL));
  }
  return 0;
}
