#include <bits/stdc++.h>
using namespace std;
using ll = long long;

long long floor_sum(long long n, long long m, long long a, long long b) {
    /*if(b < 0){
        ll up = (abs(b) + a - 1) / a;
        if(n < up)return 0;
        return floor_sum(n - up, m, a, b + up * a);
    }*/
    long long ans = 0;
    if (a >= m) {
        ans += (n - 1) * n * (a / m) / 2;
        a %= m;
    }
    if (b >= m) {
        ans += n * (b / m);
        b %= m;
    }

    long long y_max = (a * n + b) / m, x_max = (y_max * m - b);
    if (y_max == 0) return ans;
    ans += (n - (x_max + a - 1) / a) * y_max;
    ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
    return ans;
}

//0 ~ nの範囲でc * 10 ^ e <= i * k < (c + 1) * 10 ^ e となる i の個数を求める
ll f(ll n, ll k, ll c){
    ll d = 1, ans = 0;
    for(int i = 0; i < 9; i++){
        ll x = c * d;
        ll y = (c + 1) * d;
        d *= 10;
        ans += floor_sum(n, d, k, d - x) - floor_sum(n, d, k, d - y);
        //両方にdが加算されているため影響しない
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--){
        ll L, R, K, C, ans = 0, l, r, d = 1;
        cin >> L >> R >> K >> C;
        ans += f(R / K + 1, K, C);
        ans -= f((L - 1) / K + 1, K, C);
        cout << ans << '\n';
    }
}