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 int dp[100][15][15], c[100][100], q;
int cnt[15];
void prec() {
  c[0][0] = 1;
  for (int i = 1; i <= 70; i++)
    for (int j = 0; j <= i; j++) c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
  for (int i = 0; i <= 10; i++) dp[0][i][0] = 1;
  for (int i = 1; i <= 70; i++)
    for (int j = 1; j <= 10; j++)
      for (int o = 0; o <= j; o++)
        for (int k = 0; k <= i; k++)
          if (k % 2 == 1 && o)
            dp[i][j][o] += dp[i - k][j - 1][o - 1] * c[i][k];
          else if (k % 2 == 0 && !o)
            dp[i][j][o] += dp[i - k][j - 1][o] * c[i][k];
}
long long int comp(long long int x, int b) {
  long long int ret = 0ll;
  vector<int> v;
  while (x) {
    v.push_back(x % b);
    x /= b;
  }
  reverse(v.begin(), v.end());
  if (v.size() == 0) v.push_back(0);
  for (int i = 0; i <= 10; i++) cnt[i] = 0;
  for (int i = 1; i <= v.size(); i++)
    for (int j = 1; j < b; j++) ret += dp[v.size() - i - 1][b][1];
  cnt[v[0]]++;
  for (int i = 1; i < v.size(); i++) {
    for (int j = 0; j < v[i]; j++) {
      cnt[j]++;
      int o = 0, p = v.size() - i - 1;
      for (int k = 0; k < b; k++)
        if (cnt[k] % 2 == 1) o++;
      ret += dp[p][b][o];
      cnt[j]--;
    }
    cnt[v[i]]++;
  }
  for (int i = 0; i < 10; i++)
    if (cnt[i] % 2 == 1) return ret;
  ret++;
  return ret;
}
int main() {
  prec();
  cin >> q;
  while (q--) {
    long long int l, r;
    int b;
    cin >> b >> l >> r;
    cout << comp(r, b) - comp(l - 1, b) << endl;
  }
  return 0;
}
