#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const int INF = 0x3f3f3f3f;
const long long INF64 = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-7;
template <class T>
T gcd(T a, T b) {
  if (!b) return a;
  return gcd(b, a % b);
}
const int maxn = 1e6 + 10;
int dp[maxn][10];
int q;
int main() {
  for (int i = 1; i < maxn; i++) {
    for (int j = 1; j < 10; j++) dp[i][j] = dp[i - 1][j];
    int now = i;
    while (now >= 10) {
      int cnt = 1;
      while (now) {
        if (now % 10) cnt *= now % 10;
        now /= 10;
      }
      now = cnt;
    }
    dp[i][now]++;
  }
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int l, r, k;
    scanf("%d", &l);
    scanf("%d", &r);
    scanf("%d", &k);
    printf("%d\n", dp[r][k] - dp[l - 1][k]);
  }
  return 0;
}
