#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

template <typename T>
T gcd(const T &a, const T &b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

template <typename T>
T lcm(const T &a, const T &b) {
    return a * (b / gcd(a, b));
}

template <typename T>
T extgcd(const T &a, const T &b, T &x, T &y) { // |x| と |y| は結果として max(a,b) 以下になる。
    if (b == 0) {
        x = 1, y = 0;
        return a;
    }
    T g = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
    return g;
}

int mod(const long long &a, const int &m) {
    int ret = a % m;
    return ret + (ret < 0 ? m : 0);
}

int modinv(const int &a, const int &m) { // a と m は互いに素
    int x, y;
    extgcd(a, m, x, y);
    return mod(x, m);
}

template <typename T>
T floor_sum(const T &n, const T &m, T a, T b) { // Σ[0<=i<n] floor((a*i+b)/m)
    T ret = (a / m) * (n * (n - 1) / 2) + (b / m) * n;
    a %= m, b %= m;
    T y = (a * n + b) / m;
    if (y == 0) return ret;
    ret += floor_sum(y, a, m, a * n - (m * y - b));
    return ret;
}

template <typename T>
pair<T, T> Chinese_remainder_theorem(const T &a1, const T &m1, const T &a2, const T &m2) {
    T x, y, g = extgcd(m1, m2, x, y);
    if ((a2 - a1) % g != 0) return make_pair(0, -1);
    T m = m1 * (m2 / g);
    T tmp = mod(x * ((a2 - a1) / g), m2 / g);
    T a = (m1 * tmp + a1) % m;
    return make_pair(a, m);
}

bool prepare_Garner(vector<int> &a, vector<int> &m) { // m の各要素がそれぞれ互いに素とは限らない場合の前処理
    int n = a.size();
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            int g = gcd(m[i], m[j]);
            if ((a[i] - a[j]) % g != 0) return false;
            m[i] /= g, m[j] /= g;
            int gi = gcd(m[i], g), gj = g / gi;
            do {
                g = gcd(gi, gj);
                gi *= g, gj /= g;
            } while (g > 1);
            m[i] *= gi, m[j] *= gj;
        }
    }
    return true;
}

int Garner(vector<int> a, vector<int> m, const int &M) { // m の各要素はそれぞれ互いに素
    m.push_back(M);
    vector<long long> coeffs(m.size(), 1);
    vector<long long> constants(m.size(), 0);
    for (int k = 0; k < (int)a.size(); k++) {
        long long x = a[k] - constants[k], y = modinv(coeffs[k], m[k]);
        long long t = mod(x * y, m[k]);
        for (int i = k + 1; i < (int)m.size(); i++) {
            constants[i] += t * coeffs[i], constants[i] %= m[i];
            coeffs[i] *= m[k], coeffs[i] %= m[i];
        }
    }
    return constants.back();
}

vector<ll> pw(11, 1);

ll solve(ll R, ll K, ll C) {
    ll ret = 0;
    rep2(i, 0, 8) {
        {
            ll x = pw[i] * (C + 1) - 1;
            ll k = (R + pw[i + 1] - x) / pw[i + 1];
            ret += floor_sum(k, K, pw[i + 1], x);
            ll y = x + k * pw[i + 1];
            if (y - pw[i] <= R && R <= y) ret += R / K;
        }
        {
            ll x = pw[i] * C - 1;
            ll k = (R + pw[i + 1] - x) / pw[i + 1];
            ret -= floor_sum(k, K, pw[i + 1], x);
        }
    }
    return ret;
}

int main() {
    rep(i, 10) pw[i + 1] = pw[i] * 10;
    int T;
    cin >> T;

    while (T--) {
        ll L, R, K, C;
        cin >> L >> R >> K >> C;

        cout << solve(R, K, C) - solve(L - 1, K, C) << '\n';
    }
}