#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define DEBUG(...)
#endif

template <class T, class Op = multiplies<T>>
constexpr T power(T a, long long n, Op op = Op(), T e = {1}) {
  assert(n >= 0);
  while (n) {
    if (n & 1) e = op(e, a);
    if (n >>= 1) a = op(a, a);
  }
  return e;
}

template <unsigned M> struct modular {
  using m = modular;
  static constexpr unsigned mod = M;
  unsigned v;
  modular(long long x = 0) : v((x %= mod) < 0 ? x + mod : x) {}
  m operator-() const { return m() -= *this; }
  m& operator+=(m b) { if ((int)(v += b.v - mod) < 0) v += mod; return *this; }
  m& operator-=(m b) { if ((int)(v -= b.v) < 0) v += mod; return *this; }
  m& operator*=(m b) { v = (uint64_t)v * b.v % mod; return *this; }
  m& operator/=(m b) { return *this *= power(b, mod - 2); }
  friend m operator+(m a, m b) { return a += b; }
  friend m operator-(m a, m b) { return a -= b; }
  friend m operator*(m a, m b) { return a *= b; }
  friend m operator/(m a, m b) { return a /= b; }
  friend bool operator==(m a, m b) { return a.v == b.v; }
};

using mint = modular<power(10, 9) + 7>;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  string s;
  cin >> s;
  int d;
  cin >> d;
  if (d == 0) {
    bool ok = true;
    for (char c : s) {
      if (c != '?' and c != '0') {
        ok = false;
        break;
      }
    }
    cout << ok << '\n';
    exit(0);
  }
  vector<mint> dp(9);
  dp[0] = 1;
  for (char c : s) {
    vector<mint> ndp(9);
    for (int i = 0; i < 10; ++i) {
      if (c != '?' and (c - '0') != i) continue;
      for (int r = 0; r < 9; ++r) {
        ndp[(r + i) % 9] += dp[r];
      }
    }
    swap(dp, ndp);
  }
  cout << dp[d % 9].v << '\n';
}