#include <bits/stdc++.h>
using namespace std;
const int todx[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int tody[] = {-1, 1, -2, 2, -2, 2, -1, 1};
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
void func(void) {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
void printStack(stack<string> s) {
  if (s.empty()) return;
  string x = s.top();
  s.pop();
  printStack(s);
  cout << x;
  s.push(x);
}
long long binaryexp(long long n, long long p) {
  if (p == 0) return 1;
  if (p % 2 == 0)
    return binaryexp((n % 1000000007) * (n % 1000000007), p / 2);
  else
    return ((n % 1000000007) *
            binaryexp(((n % 1000000007) * (n % 1000000007)) % 1000000007,
                      (p - 1) / 2) %
            1000000007);
}
vector<long long> spf(10000001, 0);
void siv() {
  spf[1] = 1;
  for (long long i = 2; i < 10000001; i++) spf[i] = i;
  for (long long i = 4; i < 10000001; i += 2) {
    spf[i] = 2;
  }
  for (long long i = 3; i * i < 10000001; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 10000001; j += i) {
        if (spf[j] == j) {
          spf[j] = i;
        }
      }
    }
  }
}
int main() {
  string n;
  long long k;
  cin >> n >> k;
  long long ans = 0;
  long long in2 = binaryexp(2, (k)*n.size());
  long long in3 = binaryexp(2, n.size());
  in3 = ((1 % 1000000007 - in3 % 1000000007) + 1000000007) % 1000000007;
  in3 = binaryexp(in3, 1000000007 - 2);
  in2 = ((1 % 1000000007 - in2 % 1000000007) + 1000000007) % 1000000007;
  in2 = (in2 * in3) % 1000000007;
  for (int i = 0; i < n.size(); i++) {
    if (n[i] == '0' or n[i] == '5') {
      long long in = binaryexp(2, i);
      in = in % 1000000007 * in2 % 1000000007;
      in %= 1000000007;
      ans = (ans % 1000000007 + in % 1000000007) % 1000000007;
    }
  }
  cout << ans << endl;
}
