#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000010;
int f[MAXN], g[MAXN], l, r, q, tc = 1, in;
vector<pair<int, int> > s;
bool used[MAXN];
int beg[MAXN], ans[MAXN], k[MAXN], kek[MAXN];
int main() {
  ios_base::sync_with_stdio(0);
  for (int i = 1; i < 10; i++) {
    f[i] = i;
    g[i] = i;
  }
  for (int i = 10; i < MAXN; i++) {
    f[i] = f[i / 10] * max(1, (i % 10));
    g[i] = g[f[i]];
  }
  cin >> q;
  for (int i = 0; i < q; i++) {
    cin >> l >> r >> kek[i];
    s.push_back({l, i});
    s.push_back({r + 1, i});
  }
  sort(s.begin(), s.end());
  for (int i = 0; i < s.size(); i++) {
    for (int j = tc; j < s[i].first; j++) {
      k[g[j]]++;
      tc++;
    }
    if (used[s[i].second]) {
      ans[s[i].second] = k[kek[s[i].second]] - beg[s[i].second];
    } else {
      used[s[i].second] = true;
      beg[s[i].second] = k[kek[s[i].second]];
    }
  }
  for (int i = 0; i < q; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}
