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
 *
 * @author Liavontsi Brechka
 */
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
    @SuppressWarnings("Duplicates")
    class TaskD {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            int[] twos = new int[n];
            int[] fives = new int[n];

            long next;
            int t, f;
            for (int i = 0; i < n; i++) {
                next = in.nextLong();

                t = 0;
                while (next % 2L == 0L) {
                    next /= 2L;
                    t++;
                }
                twos[i] = t;

                f = 0;
                while (next % 5L == 0L) {
                    next /= 5L;
                    f++;
                }
                fives[i] = f;
            }

            int[][][] dp = new int[2][k + 1][10000];
            for (int i = 0; i <= k; i++) {
                Arrays.fill(dp[0][i], -1);
                Arrays.fill(dp[1][i], -1);
            }
            dp[0][0][0] = 0;

            int flag = 1;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j <= k; j++) {
                    for (int l = 0; l < 10000; l++) {
                        if (dp[flag ^ 1][j][l] == -1) continue;

                        if (j + 1 <= k)
                            dp[flag][j + 1][l + fives[i]] = Math.max(dp[flag][j + 1][l + fives[i]],
                                    dp[flag ^ 1][j][l] + twos[i]);
                        dp[flag][j][l] = Math.max(dp[flag][j][l], dp[flag ^ 1][j][l]);
                    }
                }

                flag ^= 1;
                if (i != n - 1) for (int j = 0; j <= k; j++) Arrays.fill(dp[flag][j], -1);
            }

            flag ^= 1;
            int res = 0;
            for (int j = 0; j < 10000; j++) res = Math.max(res, Math.min(j, dp[flag][k][j]));

            out.print(res);
        }

    }

    static class InputReader {
        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

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

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

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(readLine());
            }
            return tokenizer.nextToken();
        }

        public String readLine() {
            String line;
            try {
                line = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            return line;
        }

    }
}

