import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;
import core.bitop, core.thread;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


immutable long MO = 1_000_000_007;

int D;
string N;

void main() {
  try {
    for (; ; ) {
      N = readToken();
      D = readInt();
      auto dp = new long[][](N.length, D);
      dp[0][0] = 1;
      foreach (i; 1 .. dp.length) {
        foreach (d; 0 .. D) {
          foreach (x; 0 .. 10) {
            (dp[i][(d + x) % D] += dp[i - 1][d]) %= MO;
          }
        }
      }
      
      long ans;
      
      // first differs at pos
      int sum;
      foreach (pos; 0 .. N.length) {
        foreach (x; 0 .. N[pos] - '0') {
          (ans += dp[N.length - 1 - pos][((-(sum + x)) % D + D) % D]) %= MO;
        }
        sum += (N[pos] - '0');
      }
      
      // N
      if (sum % D == 0) {
        ++ans;
      }
      
      // 0
      --ans;
      
      ans = (ans % MO + MO) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
