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 n;
long long dp[105][15][1025];
long long calc(int base, long long num) {
  if (num <= 0) return 0LL;
  long long up = 1, ret = 0;
  for (int i = 1;; i++) {
    up = up * base;
    if (num >= up) {
      for (int x = 1; x < base; x++) {
        ret += dp[i - 1][base][(1 << x)];
        ret %= 1000000007;
      }
    } else {
      int v[65], N = 0;
      while (num) {
        v[i - N] = num % base;
        N++;
        num /= base;
      }
      assert(N == i);
      int premask = 0;
      for (int j = 0; j <= i; j++) {
        if (j == i) {
          ret += !premask;
          ret %= 1000000007;
          return ret;
        }
        for (int x = (!j ? 1 : 0); x < v[j + 1]; x++) {
          ret += dp[i - j - 1][base][premask ^ (1 << x)];
          ret %= 1000000007;
        }
        premask ^= (1 << v[j + 1]);
      }
    }
  }
}
int main() {
  cin >> n;
  for (int b = 2; b <= 10; b++) {
    dp[0][b][0] = 1;
    for (int x = 0; x < 100; x++) {
      for (int y = 0; y < (1 << b); y++) {
        if (dp[x][b][y] == 0) continue;
        for (int z = 0; z < b; z++) {
          dp[x + 1][b][y ^ (1 << z)] += dp[x][b][y];
          dp[x + 1][b][y ^ (1 << z)] %= 1000000007;
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    int b;
    long long l, r;
    scanf("%d%lld%lld", &b, &l, &r);
    printf("%lld\n", calc(b, r) - calc(b, l - 1));
  }
}
