#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
#include <atcoder/math>

using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


const i64 INF = 1001001001001001001;
using modint = atcoder::static_modint<998244353>;


int main(){
    int T; cin >> T;
    while(T --> 0){
        i64 L, R, K, C; cin >> L >> R >> K >> C;
        L = (L + K - 1) / K * K;
        if(L > R){ cout << "0\n"; continue; }
        i64 N = (R - L) / K + 1;
        i64 ans = 0;
        for(i64 d = 1; d <= 1'000'000'000; d *= 10){
            i64 s = atcoder::floor_sum(N, d*10, K, L+(9-C)*d);
            i64 t = atcoder::floor_sum(N, d*10, K, L+(10-C)*d);
            ans += t - s;
        }
        cout << ans << '\n';
    }
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;