#include <bits/stdc++.h>
using namespace std;
const long double pi = 2 * acos(0.0);
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a * (b / gcd(a, b));
}
template <class T, class TT>
bool pal(T a, TT n) {
  int k = 0;
  for (int i = 0; i <= n / 2; i++) {
    if (a[i] != a[n - i - 1]) {
      k = 1;
      break;
    }
  }
  return k ? 0 : 1;
}
int f(int x) {
  int p = 1;
  while (x) {
    int k = x % 10;
    if (k) p *= k;
    x /= 10;
  }
  return p;
}
int g(int x) {
  if (x < 10)
    return x;
  else
    return g(f(x));
}
int dp[20][1222222];
int a[200], cnt[200];
int main() {
  for (int i = 1; i <= 1e6 + 100; i++) {
    for (int j = 1; j <= 9; j++) dp[j][i] = dp[j][i - 1];
    dp[g(i)][i]++;
  }
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    int l, r, n;
    scanf("%d%d%d", &l, &r, &n);
    printf("%d\n", dp[g(n)][r] - dp[g(n)][l - 1]);
  }
  getchar();
  getchar();
  return 0;
}
