import java.util.Scanner;

public class Main {
	static Scanner sc = new Scanner(System.in);
	static final int MOD = 1_000_000_007;

	public static void main(String[] args) {
		char[] S = sc.next().toCharArray();
		int M = sc.nextInt();
		long[][] count = new long[2][M];
		long ans = 0;
		int t = 0;
		for (int i = 0; i < S.length; ++i) {
			for (int j = 0; j < M; ++j) {
				count[t][j] = count[1-t][j];
			}
			for (int j = 0; j < M; ++j) {
				int next = (j * 10 + S[i] - '0') % M;
				count[t][next] += count[1 - t][j];
				if (count[t][next] >= MOD) count[t][next] -= MOD;
			}
			if (S[i] == '0') {
				++ans;
			} else {
				count[t][(S[i] - '0') % M]++;
			}
			t = 1 - t;
		}
		ans += count[1-t][0];
		System.out.println(ans % MOD);
	}

}