#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
stringstream output;
inline void eOP();
int g[1000001];
int s[10][1000001];
inline void solve() {
  int l, r, k;
  cin >> l >> r >> k;
  output << (s[k][r] - s[k][l - 1]) << endl;
}
inline void init() {
  for (int i = 0; i < 10; ++i) {
    g[i] = i;
  }
  for (int i = 10; i <= 1000000; ++i) {
    int n = 1;
    int temp = i;
    while (temp) {
      if (temp % 10) {
        n *= temp % 10;
      }
      temp /= 10;
    }
    g[i] = g[n];
  }
  for (int k = 1; k < 10; ++k) {
    s[k][0] = 0;
    for (int i = 1; i <= 1000000; ++i) {
      s[k][i] = s[k][i - 1] + (g[i] == k);
    }
  }
}
int main() {
  init();
  size_t t = 1;
  cin >> t;
  for (int i = 0; i < t; ++i) {
    solve();
  }
  eOP();
}
inline void eOP() {
  cout << output.str();
  output.str(string());
  exit(0);
}
