#include <bits/stdc++.h>
using namespace std;
long long solve(int N, int K, int C){
  string S = to_string(N);
  int L = S.size();
  vector<vector<vector<long long>>> cnt(L + 1, vector<vector<long long>>(2, vector<long long>(K, 0)));
  vector<vector<vector<long long>>> sum(L + 1, vector<vector<long long>>(2, vector<long long>(K, 0)));
  cnt[0][0][0] = 1;
  for (int i = 0; i < L; i++){
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < K; k++){
        if (cnt[i][j][k] > 0){
          for (int l = 0; l < 10; l++){
            if (j == 0 && l > S[i] - '0'){
              continue;
            }
            int j2 = j;
            if (l < S[i] - '0'){
              j2 = 1;
            }
            int k2 = (k * 10 + l) % K;
            cnt[i + 1][j2][k2] += cnt[i][j][k];
            sum[i + 1][j2][k2] += sum[i][j][k];
            if (l == C){
              sum[i + 1][j2][k2] += cnt[i][j][k];
            }
          }
        }
      }
    }
  }
  return sum[L][1][0];
}
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    int L, R, K, C;
    cin >> L >> R >> K >> C;
    if ((R - L) / K < 50000){
      int ans = 0;
      for (int j = (L + K - 1) / K * K; j <= R; j += K){
        int k = j;
        while (k > 0){
          if (k % 10 == C){
            ans++;
          }
          k /= 10;
        }
      }
      cout << ans << endl;
    } else {
      cout << solve(R + 1, K, C) - solve(L, K, C) << endl;
    }
  }
}