#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 1e9 + 7;

int main() {
  string s;
  int D;
  cin >> s >> D;

  int sum = 0;
  int n = 0;

  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '?') n++;
    else {
      sum += (s[i] - '0');
      if (sum > 9) sum -= 9;
    }
  }

  vector<vector<int>> dp(n + 1, vector<int>(10, 0));
  dp[0][sum] = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 10; j++) {
      for (int k = 0; k < 10; k++) {
        int next = (j +  k);
        if (next > 9) next -= 9;
        (dp[i + 1][next] += dp[i][j]) %= mod;
      }
    }
  }
  cout << dp[n][D] << endl;
  return 0;
}