#include<stdio.h>
#include<math.h>
#include<string.h>
#define ll long long int
ll ans=0;
ll po(ll x, ll y, ll ii){
ll k, i, j; k=1;
while(y>0){
if(y%2==1){
k=(k*x)%ii;
} y=y/2; x=(x*x)%ii;
} return k;
}
int main(){
ll n, i, k, x, y, p, q, j, ii, jj, t, a[200010];
char s[200010]; ii=1e9+7;
scanf("%s", s); n=strlen(s);
scanf("%lld", &k); y=1;
for(i=0; i<n; i++){
if(s[i]=='0' || s[i]=='5'){
x=po(2, i+n*k, ii);
p=po(2, n, ii);
p=po(p-1, ii-2, ii);
q=(x-y)%ii; q=(q*p)%ii; if(q<0) q+=ii;
ans=(ans+q)%ii;
} y=(y*2)%ii;
}
printf("%lld\n", ans);
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |