#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


int f(int a,int c){
	int ans=0;
	while(a){
		if(a%10==c) ans++;
		a/=10;
	}
	return ans;
}
void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,t) solve();
}

void solve(){
	int L,R,K,C;
	cin>>L>>R>>K>>C;
	L=((L-1)/K+1)*K;
	R=((R/K)+1)*K;
	ll ans=0;
	if((R-L)/K<100000){
		while(L<R) ans+=f(L,C),L+=K;
		cout<<ans<<"\n";
		return;
	}
	int J=100000;
	int D=L%J;
	int X=(R-L)/K;
	rep(i,J){
		ans+=(X/J)*f(D,C);
		if(i<X%J) ans+=f(D,C);
		D=(D+K)%J;
	}
	D=L/J;
	while(D*J<R){
		int A=max(L,((D*J-1)/K+1)*K);
		int B=min(R,(((D+1)*J-1)/K+1)*K);
		if(B>A) ans+=f(D,C)*((B-A)/K);
		D++;
	}
	cout<<ans<<"\n";
}