import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

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.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10^^9 + 7;

void addTo(ref int t, int f) {
  t += f;
  if (t >= MO) t -= MO;
}

string S;
int M;

void main() {
  try {
    for (; ; ) {
      S = readToken();
      M = readInt();
      
      auto dp = new int[M];
      auto dpNext = new int[M];
      long ans;
      foreach (c; S) {
        const d = c - '0';
        dpNext[] = 0;
        if (d == 0) {
          ++ans;
        } else {
          dpNext[d % M] += 1;
        }
        foreach (x; 0 .. M) {
          addTo(dpNext[(x * 10    ) % M], dp[x]);
          addTo(dpNext[(x * 10 + d) % M], dp[x]);
        }
        swap(dp, dpNext);
      }
      ans += dp[0];
      ans = (ans % MO + MO) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}