/* -*- coding: utf-8 -*-
 *
 * 1085.cc:  No.1085 桁和の桁和 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MOD = 1000000007;

/* typedef */

/* global variables */

char s[MAX_N + 4];
int dp[2][9];

/* subroutines */

inline void addmod(int &a, int b) { a = (a + b) % MOD; }

/* main */

int main() {
  int d;
  scanf("%s%d", s, &d);

  int m = 0, sum = 0;
  bool zf = true;
  for (char *cpt = s; *cpt; cpt++) {
    if (*cpt == '?') m++;
    else {
      sum += (*cpt - '0');
      if (*cpt != '0') zf = false;
    }
  }

  if (d == 0) {
    printf("%d\n", zf ? 1 : 0);
    return 0;
  }

  int cur = 0, nxt = 1;
  dp[0][sum % 9] = 1;

  for (int i = 0; i < m; i++) {
    memset(dp[nxt], 0, sizeof(dp[nxt]));

    for (int j = 0; j < 9; j++)
      for (int k = 0; k <= 9; k++)
	addmod(dp[nxt][(j + k) % 9], dp[cur][j]);

    swap(cur, nxt);
  }

  int ans = dp[cur][d % 9];
  if (d == 9 && sum == 0) ans--;
  printf("%d\n", ans);
  return 0;
}