/** author: shobonvip created: 2025.07.12 05:57:13 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint1000000007 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); string s; cin >> s; vector> mat0(9, vector(9)); vector> mat1(9, vector(9)); rep(i,0,9){ mat0[i][i] = 1; mat1[i][i] = 1; } mat0[1][0] = 1; mat0[1][2] = 1; mat0[3][0] = 1; mat0[3][2] = 1; mat0[3][4] = 1; mat0[5][0] = 1; mat0[5][2] = 1; mat0[5][6] = 1; mat0[7][0] = 1; mat0[7][2] = 1; mat0[7][4] = 1; mat0[7][6] = 1; mat0[7][8] = 1; mat1[2][0] = 1; mat1[2][1] = 1; mat1[4][0] = 1; mat1[4][1] = 1; mat1[4][3] = 1; mat1[6][0] = 1; mat1[6][1] = 1; mat1[6][5] = 1; mat1[8][0] = 1; mat1[8][1] = 1; mat1[8][3] = 1; mat1[8][5] = 1; mat1[8][7] = 1; vector> mb(9, vector(9)); rep(i,0,9) { mb[i][i] = 1; } rep(i,0,(int)s.size()) { if (s[i] == '0') { vector> nmb(9, vector(9)); rep(x,0,9) rep(y,0,9) rep(z,0,9) { nmb[x][y] += mat0[x][z] * mb[z][y]; } swap(mb, nmb); }else{ vector> nmb(9, vector(9)); rep(x,0,9) rep(y,0,9) rep(z,0,9) { nmb[x][y] += mat1[x][z] * mb[z][y]; } swap(mb, nmb); } } vector mat(60, vector(9, vector(9))); mat[0] = mb; rep(num,0,59){ rep(i,0,9)rep(j,0,9)rep(k,0,9){ mat[num+1][i][j]+=mat[num][i][k]*mat[num][k][j]; } } ll m; cin >> m; vector arr(9); arr[0]=1; rep(num,0,60){ if(m>>num&1){ vector narr(9); rep(i,0,9)rep(j,0,9){ narr[i]+=mat[num][i][j]*arr[j]; } swap(narr,arr); } } cout<<(arr[7]+arr[8]).val()<<'\n'; }