#include <bits/stdc++.h>
using namespace std;
int n;
long long shu[1000005];
long long cnt[1000005][10];
long long fx(long long num) {
  long long sum = 1;
  while (num) {
    long long yu = num % 10;
    num /= 10;
    if (yu != 0) sum *= yu;
  }
  return sum;
}
long long gx(long long num) {
  if (num < 10)
    return num;
  else {
    return gx(fx(num));
  }
}
void init() {
  memset(cnt, 0, sizeof(cnt));
  for (long long i = 1; i <= 1000000; i++) {
    long long ans = gx(i);
    cnt[i][ans]++;
    for (int j = 1; j <= 9; j++) cnt[i][j] += cnt[i - 1][j];
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  init();
  cin >> n;
  while (n--) {
    long long l, r, k;
    cin >> l >> r >> k;
    cout << cnt[r][k] - cnt[l - 1][k] << endl;
  }
}
