#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

#include <atcoder/modint>
using mint = atcoder::modint1000000007;
using Mat = array<array<mint, 7>, 7>;
Mat M0, M1;
void precalc() {
    rep(i, 7) rep(j, 7) M0[i][j] = M1[i][j] = 0;
    rep(i, 7) M0[i][i] = M1[i][i] = 1;
    M1[3][0] = M1[4][0] = M1[5][0] = M1[4][1] = M1[5][2] = M1[3][6] = M1[4][6] = M1[5][6] = M1[6][6] = 1;
    M1[5][1] = 2;
    M0[0][3] = M0[0][6] = 1;
    M0[1][3] = M0[1][4] = M0[1][6] = 1;
    M0[2][3] = M0[2][5] = M0[2][6] = 1;
    M0[2][4] = 2;
}
Mat op(const Mat& a, const Mat& b) {
    Mat res{};
    rep(i, 7) rep(k, 7) rep(j, 7) res[i][j] += a[i][k] * b[k][j];
    return res;
}
Mat dpow(Mat a, ll n) {
    Mat res{};
    rep(i, 7) res[i][i] = 1;
    while (n) {
        if (n & 1) res = op(res, a);
        a = op(a, a);
        n >>= 1;
    }
    return res;
}
void run_case() {
    string T;
    ll K;
    cin >> T >> K;
    array<mint, 7> B{};
    B[6] = 1;
    Mat res{};
    rep(i, 7) res[i][i] = 1;
    reverse(all(T));
    rep(i, T.size()) {
        if (T[i] == '1') res = op(res, M1);
        else res = op(res, M0);
    }
    res = dpow(res, K);
    mint ans = res[2][6] + res[5][6];
    cout << ans.val() << "\n";
}
int main() {
    precalc();
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}