#include <bits/stdc++.h>
using namespace std;
long long dp[11][63][1 << 11], ans[11][63], dp2[11][63][1 << 11];
void init() {
  for (int base = 2; base <= 10; base++) {
    dp[base][0][0] = dp2[base][0][0] = 1;
    for (int len = 1; len <= 62; len++) {
      for (int s = 0; s < (1 << base); s++) {
        for (int x = len == 1 ? 1 : 0; x < base; x++) {
          dp[base][len][s] += dp[base][len - 1][s ^ (1 << x)];
        }
        for (int x = 0; x < base; x++)
          dp2[base][len][s] += dp2[base][len - 1][s ^ (1 << x)];
      }
      ans[base][len] = dp[base][len][0];
    }
  }
}
int toBase[63];
int change(long long x, int base) {
  int len = 0;
  while (x > 0) {
    toBase[len++] = x % base;
    x /= base;
  }
  return len;
}
void dfs(int pos, int s, bool ok, int base, int len, long long& ways) {
  if (ok) {
    ways += dp2[base][pos + 1][s];
    return;
  }
  if (pos < 0) {
    ways += (s == 0);
    return;
  }
  dfs(pos - 1, s ^ (1 << toBase[pos]), ok, base, len, ways);
  for (int x = (pos == len - 1 ? 1 : 0); x < toBase[pos]; x++)
    dfs(pos - 1, s ^ (1 << x), true, base, len, ways);
}
long long solve(long long x, int base) {
  if (x == 0) return 0;
  long long res = 0;
  int len = change(x, base);
  for (int l = 1; l < len; l++) res += ans[base][l];
  dfs(len - 1, 0, false, base, len, res);
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  init();
  int q, b;
  long long l, r;
  cin >> q;
  while (q--) {
    cin >> b >> l >> r;
    cout << solve(r, b) - solve(l - 1, b) << '\n';
  }
  return 0;
}
