#include <bits/stdc++.h>
using namespace std;
int bar[1000006 + 6];
unordered_map<int, vector<int> > store;
int findFrequency(int left, int right, int element) {
  int a =
      (int)(lower_bound(store[element].begin(), store[element].end(), left) -
            store[element].begin());
  int b =
      (int)(upper_bound(store[element].begin(), store[element].end(), right) -
            store[element].begin());
  return b - a;
}
int fun(int n) {
  int p = 1;
  while (n > 0) {
    int tmp = n % 10;
    p *= (tmp ? tmp : 1);
    n /= 10;
  }
  return p;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int q, l, r, k, n, cnt;
  for (int i = 1; i < 1000006; i++) {
    n = i;
    while (n >= 10) {
      n = fun(n);
    }
    bar[i] = n;
  }
  int sz = sizeof(bar) / sizeof(bar[0]);
  for (int i = 0; i < sz; ++i) store[bar[i]].push_back(i + 1);
  cin >> q;
  while (q--) {
    cin >> l >> r >> k;
    cnt = findFrequency(l + 1, r + 1, k);
    cout << cnt << '\n';
  }
  return 0;
}
