#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 2;
const int W = 1e7 + 1;
int arr[10][N];
long long visited[W];
long long calc(long long x) {
  if (x < 10) return x;
  if (visited[x]) return visited[x];
  string s = to_string(x);
  long long prod = 1;
  for (int i = 0; i < int((s).size()); i++)
    if (s[i] - '0') prod *= (s[i] - '0');
  return visited[prod] = calc(prod);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  for (int i = 1; i < N; i++) {
    arr[calc(i)][i]++;
  }
  for (int j = 1; j < N; j++) {
    for (int i = 0; i < 10; i++) {
      arr[i][j] += arr[i][j - 1];
    }
  }
  int t;
  cin >> t;
  while (t--) {
    int l, r, k;
    cin >> l >> r >> k;
    cout << arr[k][r] - arr[k][l - 1] << endl;
  }
  return 0;
}
