#include <bits/stdc++.h>
using namespace std;
const double inf = 1.0 / 0.0;
const double pi = 2 * acos(0.0);
int cmp_double(double a, double b = 0, double eps = 1e-9) {
  return a + eps > b ? b + eps > a ? 0 : 1 : -1;
}
int funcGNum[1000010] = {0};
int funcG(int c) {
  if (funcGNum[c] > 0) return funcGNum[c];
  int r, pro = 1;
  for (int i = c; i > 0; i = i / 10) {
    r = i % 10;
    if (r > 0) pro = pro * r;
  }
  if (pro < 10)
    return pro;
  else
    funcG(pro);
}
int main(void) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  unordered_map<int, vector<int> > mapa;
  for (int i = 1; i <= 9; i++) funcGNum[i] = i;
  for (int i = 1; i <= 1000000; i++) {
    int at = funcG(i);
    funcGNum[i] = at;
    if (mapa.find(at) == mapa.end()) {
      vector<int> vec = {i};
      mapa.insert(make_pair(at, vec));
    } else {
      mapa[at].push_back(i);
    }
  }
  int q;
  cin >> q;
  for (int i = 0; i < int(q); i++) {
    int l, r, k;
    cin >> l >> r >> k;
    int posBegin =
        lower_bound((mapa[k]).begin(), (mapa[k]).end(), l) - mapa[k].begin();
    int posEnd =
        upper_bound((mapa[k]).begin(), (mapa[k]).end(), r) - mapa[k].begin();
    cout << posEnd - posBegin << endl;
  }
  return 0;
}
