Let's call the roundness of the number the number of zeros to which it ends.

You have an array of n numbers. You need to choose a subset of exactly k numbers so that the roundness of the product of the selected numbers will be maximum possible.

Input

The first line contains two integer numbers n and k (1 ≤ n ≤ 200, 1 ≤ k ≤ n).

The second line contains n space-separated integer numbers a1, a2, ..., an (1 ≤ ai ≤ 1018).

Output

Print maximal roundness of product of the chosen subset of length k.

Examples

Input

3 2
50 4 20


Output

3


Input

5 3
15 16 3 25 9


Output

3


Input

3 3
9 77 13


Output

0

Note

In the first example there are 3 subsets of 2 numbers. [50, 4] has product 200 with roundness 2, [4, 20] — product 80, roundness 1, [50, 20] — product 1000, roundness 3.

In the second example subset [15, 16, 25] has product 6000, roundness 3.

In the third example all subsets has product with roundness 0.
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int N = 201;
const int M = N * 30;
int n, k, f1[N], f2[N];
long long a[N];
int dp[N][M], tmp[N][M];
void maximize(int &x, const int &y) { x = max(x, y); }
void solve() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    while (a[i] % 5 == 0) {
      f1[i]++;
      a[i] /= 5;
    }
    while (a[i] % 2 == 0) {
      f2[i]++;
      a[i] /= 2;
    }
  }
  for (int j = 0; j <= k; ++j) {
    for (int h = 0; h <= N * 30; ++h) {
      dp[j][h] = tmp[j][h] = -INF;
    }
  }
  dp[0][0] = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= k; ++j) {
      for (int h = 0; h <= i * 30; ++h) {
        tmp[j][h] = dp[j][h];
        if (h >= f1[i] && j >= 1) {
          maximize(tmp[j][h], dp[j - 1][h - f1[i]] + f2[i]);
        }
      }
    }
    for (int j = 0; j <= k; ++j) {
      for (int h = 0; h <= i * 30; ++h) {
        dp[j][h] = tmp[j][h];
      }
    }
  }
  int res = 0;
  for (int h = 0; h <= n * 30; ++h) {
    maximize(res, min(h, dp[k][h]));
  }
  cout << res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
