import sys
input = sys.stdin.readline

# https://qiita.com/AkariLuminous/items/3e2c80baa6d5e6f3abe9#4-floor_sum
# sum_{i=0}^{n-1} (a * i + b)//m
def floor_sum(n, m, a, b=0):
    ans = 0
    while True:
        if a >= m or a < 0:
            ans += n * (n - 1) * (a // m) // 2
            a %= m
        if b >= m or b < 0:
            ans += n * (b // m)
            b %= m
        y_max = a * n + b
        if y_max < m: break
        n, b, m, a = y_max // m, y_max % m, a, m
    return ans

def solve(n, K, C):
    ans = 0
    ten = 1
    num = n // K + 1
    for i in range(12):
        ans += floor_sum(num, 10*ten, K, (10 - C) * ten) - floor_sum(num, 10*ten, K, (9 - C) * ten)
        ten *= 10
    return ans
        
T = int(input())
for _ in range(T):
    L, R, K, C = map(int, input().split())
    print(solve(R, K, C) - solve(L - 1, K, C))