#include "atcoder/modint.hpp"
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint1000000007;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

vector<vector<mint>> pow(i64 n, vector<vector<mint>> &a) {
  vector<vector<mint>> res(9, vector<mint>(9, 0));
  vector<vector<mint>> t = a;
  for (i64 i = 0; i < 9; i++) res[i][i] = 1;
  while (n > 0) {
    if (n & 1) {
      vector<vector<mint>> nres(9, vector<mint>(9, 0));
      for (i64 i = 0; i < 9; i++) {
        for (i64 j = 0; j < 9; j++) {
          for (i64 k = 0; k < 9; k++) {
            nres[i][j] += res[k][j] * t[i][k];
          }
        }
      }
      swap(nres, res);
    }
    vector<vector<mint>> nt(9, vector<mint>(9, 0));
    for (i64 i = 0; i < 9; i++) {
      for (i64 j = 0; j < 9; j++) {
        for (i64 k = 0; k < 9; k++) {
          nt[i][j] += t[k][j] * t[i][k];
        }
      }
    }
    swap(nt, t);
    n >>= 1;
  }
  return res;
}

void _main() {
  string t;
  i64 n;
  cin >> t >> n;
  vector<i64> s(t.size());
  for (i64 i = 0; i < t.size(); i++) {
    s[i] = t[i] - '0';
  }
  vector<vector<mint>> a(9, vector<mint>(9, 0));
  for (i64 i = 0; i < 9; i++) a[i][i] = 1;
  for (i64 x = 0; x < 9; x++) {
    vector<mint> dp(9, 0);
    dp[x] = 1;
    for (i64 i = 0; i < s.size(); i++) {
      vector<mint> ndp = dp;
      if (s[i] == 0) {
        ndp[0] += dp[1] + dp[2];
        ndp[3] += dp[4] + dp[1] * 2 + dp[5] + dp[2] * 2;
        ndp[6] += dp[7] + dp[4] + dp[8] + dp[5];
      } else {
        ndp[1] += dp[0] + dp[2];
        ndp[4] += dp[3] + dp[0] * 2 + dp[5] + dp[2] * 2;
        ndp[7] += dp[6] + dp[3] + dp[8] + dp[5];
      }
      swap(dp, ndp);
    }
    for (i64 i = 0; i < 9; i++) {
      a[i][x] = dp[i];
    }
  }
  vector<vector<mint>> dp = pow(n, a);
  mint ans = 0;
  ans += dp[6][2] + dp[7][2] + dp[6][5] + dp[7][5];
  cout << ans.val() << "\n";
}