MOD = 10**9 + 7

S = input().strip()
M = int(input())
mod = M

prev_dp0 = 1
prev_dp1 = [0] * mod
prev_dp2 = [0] * mod

for c in S:
    c_num = int(c)
    current_mod = c_num % mod
    
    new_dp0 = prev_dp0
    new_dp1 = prev_dp1.copy()
    new_dp2 = prev_dp2.copy()
    
    # Transition from prev_dp0
    if c_num == 0:
        new_dp2[current_mod] = (new_dp2[current_mod] + prev_dp0) % MOD
    else:
        new_dp1[current_mod] = (new_dp1[current_mod] + prev_dp0) % MOD
    
    # Transition from prev_dp1 (appending current character)
    temp_dp1 = [0] * mod
    for r in range(mod):
        if prev_dp1[r]:
            new_r = (r * 10 + c_num) % mod
            temp_dp1[new_r] = (temp_dp1[new_r] + prev_dp1[r]) % MOD
    
    for r in range(mod):
        new_dp1[r] = (new_dp1[r] + temp_dp1[r]) % MOD
    
    # Update previous states for next iteration
    prev_dp0, prev_dp1, prev_dp2 = new_dp0, new_dp1, new_dp2

# Sum the valid subsequences: those in dp1 and dp2 with remainder 0
answer = (prev_dp1[0] + prev_dp2[0]) % MOD
print(answer)