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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}

const ll MOD = 1e9 + 7;

const int MAX_N = 112345;

ll dp[MAX_N][10];

int main2() {
  CLR(dp, 0);

  string S; cin >> S;
  int D = nextLong();


  const int N = S.size();

  if (D == 0) {
    bool all_zero = true;
    REP(i, N) if (S[i] != '0') all_zero = false;
    cout << (all_zero ? 1 : 0) << endl;
    return 0;
  }

  if (D == 9) D = 0;

  dp[0][0] = 1;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j <= 9; j++) {
      for (int k = 0; k <= 9; k++) {
        if (S[i] == '?' || S[i] == '0'+k) {
          (dp[i+1][(j + k) % 9] += dp[i][j]) %= MOD;
        }
      }
    }
  }

  ll ans = dp[N][D];
  cout << ans << endl;
  return 0;
}

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}