Problem:
Score : 100 points

Problem Statement

Find the number of integers between 1 and K (inclusive) satisfying the following condition, modulo 10^9 + 7:

The sum of the digits in base ten is a multiple of D.

Constraints

All values in input are integers.

1 \leq K < 10^{10000}

1 \leq D \leq 100

Input

Input is given from Standard Input in the following format:

K
D

Output

Print the number of integers satisfying the condition, modulo 10^9 + 7.

Sample Input 1

30
4

Sample Output 1

6

Those six integers are: 4, 8, 13, 17, 22 and 26.

Sample Input 2

1000000009
1

Sample Output 2

2

Be sure to print the number modulo 10^9 + 7.

Sample Input 3

98765432109876543210
58

Sample Output 3

635270834

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String n = sc.next();
    int d = sc.nextInt();
    long MOD = (long)Math.pow(10, 9) + 7;
    int len = n.length();
    long[][][] dp = new long[len][2][d];
    int first = Integer.parseInt(String.valueOf(n.charAt(0)));
    for(int i = 0; i < first; i++) {
      dp[0][1][(i % d)]++; 
    }
    first %= d;
    dp[0][0][first]++;
    int sum = first;
    for(int i = 1; i < len; i++) {
      int k = Integer.parseInt(String.valueOf(n.charAt(i)));
      int s = sum;
      sum = (sum + k) % d;
      dp[i][0][sum] = 1;
      for(int j = 0; j < k; j++) {
        dp[i][1][(s + j) % d] = (dp[i][1][(s + j) % d] + dp[i - 1][0][s]) % MOD;
      }
      for(int j = 0; j < 10; j++) {
        for(int l = 0; l < d; l++) {
          dp[i][1][(l + j) % d] = (dp[i][1][(l + j) % d] + dp[i - 1][1][l]) % MOD;
        }
      }
    }
    System.out.println((dp[len - 1][0][0] + dp[len - 1][1][0] - 1) % MOD);
  }
}