#include<bits/stdc++.h>
using namespace std;
#define ll long long

ll p=1000000007;
ll qpow(ll x,ll n){
    ll res=1;
    while(n){
        if(n&1)
            res=res*x%p;
        x=x*x%p;
        n>>=1;
    }
    return res;
}

char a[100005];
ll k;
int main(){
    scanf("%s",a);
    scanf("%lld",&k);
    ll n=strlen(a);

    ll cur=0;
    for(int i=0;i<n;i++){
        if(a[i]=='5'||a[i]=='0'){
            cur+=qpow(2,i);
            cur%=p;
        }
    }

    ll ans=cur*(qpow(2,n*k)-1)%p*(qpow(qpow(2,n)-1,p-2))%p;
    printf("%lld\n",ans);
}