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.
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        int function(long number, int factor) {
            int cnt = 0;
            while (number % factor == 0) {
                number /= factor;
                ++cnt;
            }
            return cnt;
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), k = in.nextInt();
            long[] a = new long[n];
            for (int i = 0; i < n; ++i) a[i] = in.nextLong();

            Factor[] v = new Factor[n];
            int sum = 0, res = 0;
            for (int i = 0; i < n; ++i) {
                int t = function(a[i], 2);
                int f = function(a[i], 5);
                v[i] = new Factor(t, f);
                sum += v[i].five;
            }

            int[][] dp = new int[k + 1][sum + 1];
            for (int[] x : dp) Arrays.fill(x, (int) -1e9);
            dp[0][0] = 0;

            for (int i = 0; i < n; ++i) {
                for (int cur = k; cur >= 1; --cur) {
                    for (int to = v[i].five; to <= sum; ++to) {
                        dp[cur][to] = Math.max(dp[cur][to], dp[cur - 1][to - v[i].five] + v[i].two);
                    }
                }
            }

            for (int i = 0; i <= sum; ++i) res = Math.max(res, Math.min(i, dp[k][i]));
            out.println(res);
        }

        class Factor {
            int two;
            int five;

            public Factor(int x, int y) {
                this.two = x;
                this.five = y;
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}

