import sys
input = sys.stdin.buffer.readline
def floor_sum(n, m, a, b):
    ans = 0
    fu = False
    while True:
        if a >= m:
            ans += n * (n - 1) * (a // m) // 2
            a %= m
        if a == 0:
            ans += b // m * n
            if fu:
                ans = -ans
            return ans
        if b >= m:
            ans += n * (b // m)
            b %= m
        y = (a * n + b) // m
        ans = -(ans + n * y)
        n, m, a, b = y, a, m, m + a - b - 1
        fu = not fu
def f(r, k, c):
    ans = 0
    ten0, ten1 = 1, 10
    for _ in range(0, 10):
        ans += floor_sum(r, ten1, k, ten1 - c * ten0 + k)
        ans -= floor_sum(r, ten1, k, k)
        ten0, ten1 = ten1, ten1 * 10
    return ans
T = int(input())
ans = [0] * T
for q in range(T):
    l, r, k, c = map(int, input().split())
    l, r = (l - 1) // k, r // k
    ans[q] += f(r, k, c) - f(r, k, c + 1)
    ans[q] -= f(l, k, c) - f(l, k, c + 1)
print(*ans, sep="\n")