#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3fll;
const long long M = 1e9 + 7;
const long long maxn = 1e5 + 7;
const double eps = 0.00000001;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <typename T>
inline T powMM(T a, T b) {
  T ret = 1;
  for (; b; b >>= 1ll, a = a * a % M)
    if (b & 1) ret = 1ll * ret * a % M;
  return ret;
}
long long m, val, k;
long long dp[11][70][1024][2];
int n;
int a[70];
long long calc(int k, int cnt, int now, bool ok, bool mark) {
  if (cnt == 0) return ok && !now;
  long long ret = 0, i;
  if (!mark) {
    if (dp[k][cnt][now][ok] != -1) return dp[k][cnt][now][ok];
    for (i = 0; i <= k - 1; i++) {
      bool nxtok = (ok || i);
      int nxtnow = now;
      if (nxtok) nxtnow ^= 1 << i;
      ret += calc(k, cnt - 1, nxtnow, nxtok, 0);
    }
    dp[k][cnt][now][ok] = ret;
  } else {
    for (i = 0; i <= a[cnt]; i++) {
      bool nxtok = (ok || i), nxtmark = (i == a[cnt]);
      int nxtnow = now;
      if (nxtok) nxtnow ^= 1 << i;
      ret += calc(k, cnt - 1, nxtnow, nxtok, nxtmark);
    }
  }
  return ret;
}
int cnt;
long long solve(int k, long long x) {
  cnt = 0;
  while (x) {
    a[++cnt] = x % k;
    x /= k;
  }
  return calc(k, cnt, 0, 0, 1);
}
int main() {
  int i, j, k, t;
  memset(dp, 0xff, sizeof(dp));
  int T;
  scanf("%d", &T);
  while (T--) {
    long long l, r;
    scanf("%d%I64d%I64d", &k, &l, &r);
    printf("%I64d\n", solve(k, r) - solve(k, l - 1));
  }
}
