#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 200005;
const int INF = 0x3f3f3f3f;
const int M = 8;
void mul_mat(const int A[M][M], const int B[M][M], int C[M][M]) {
    ll tmp[M][M];
    memset(tmp, 0, sizeof(tmp));
    for (int i = 0; i < M; i++) {
        for (int k = 0; k < M; k++) {
            if (A[i][k] == 0) continue;
            for (int j = 0; j < M; j++) tmp[i][j] = (tmp[i][j] + 1ll * A[i][k] * B[k][j]) % mod;
        }
    }
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < M; j++) C[i][j] = tmp[i][j];
    }
}
void pow_mat(int A[M][M], ll e, int R[M][M]) {
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < M; j++) R[i][j] = (i == j);
    }
    int B[M][M];
    memcpy(B, A, sizeof(B));
    while (e > 0) {
        if (e & 1) {
            int T[M][M];
            mul_mat(B, R, T);
            memcpy(R, T, sizeof(T));
        }
        int T[M][M];
        mul_mat(B, B, T);
        memcpy(B, T, sizeof(T));
        e >>= 1;
    }
}

int main() {
    string T;
    ll k;
    cin >> T >> k;
    int A[2][M][M];
    for (int b = 0; b < 2; b++) {
        for (int i = 0; i < M; i++) {
            for (int j = 0; j < M; j++) A[b][i][j] = 0;
        }
    }
    for (int b = 0; b < 2; b++) {
        int oc = 1 - b;
        for (int i = 0; i < 6; i++) A[b][i][i] = 1;
        A[b][6][6] = 1;
        A[b][7][7] = 1;
        A[b][b == 0 ? 0 : 3][oc == 0 ? 0 : 3] = 1;
        A[b][b == 0 ? 0 : 3][7] = 1;
        A[b][b == 0 ? 1 : 4][oc == 1 ? 4 : 1] = 1;
        A[b][b == 0 ? 1 : 4][oc == 0 ? 0 : 3] += 1;
        A[b][b == 0 ? 1 : 4][7] = 1;
        int r = (b == 0 ? 2 : 5);
        A[b][r][oc == 0 ? 2 : 5] = 1;
        A[b][r][oc == 1 ? 4 : 1] = 2;
        A[b][r][oc == 0 ? 0 : 3] += 1;
        A[b][r][7] += 1;
        A[b][6][oc == 0 ? 2 : 5] += 1;
        A[b][6][oc == 1 ? 4 : 1] += 2;
        A[b][6][oc == 0 ? 0 : 3] += 1;
        A[b][6][7] += 1;
    }
    int tmp[M][M];
    int E[M][M];
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < M; j++) E[i][j] = (i == j);
    }
    for (auto x : T) {
        mul_mat(A[x - '0'], E, tmp);
        memcpy(E, tmp, sizeof(tmp));
    }
    int E_k[M][M];
    pow_mat(E, k, E_k);
    ll ans = E_k[6][7] % mod;
    cout << ans << "\n";
    return 0;
}