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.

//package knapsack;

import java.io.*;
import java.util.*;

public class Round {
	
	private long[] twos, fives;
	
	public static void main(String[] args) throws IOException {

		Round obj = new Round();

		obj.doStuff();

	}

	private void doStuff() throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer st = new StringTokenizer(br.readLine());
		twos = new long[Integer.parseInt(st.nextToken())];
		fives = new long[twos.length];
		int max = Integer.parseInt(st.nextToken());
		int totalFives = 0;
		
		st = new StringTokenizer(br.readLine());
		for (int i = 0; i < twos.length; i++) {
			long next = Long.parseLong(st.nextToken());
			int count = 0;
			while (next%2 == 0) {
				count++; next /= 2;
			}
			twos[i] = count; count = 0;
			while (next%5 == 0) {
				count++; next /= 5;
			}
			fives[i] = count;
			totalFives += count;
		}
		
		br.close();
		
		// nums+1, numsTaken+1, totalFives+1;
		long[][] dp = new long[max+1][totalFives+1];
		for (int i = 0; i < dp.length; i++) {
			Arrays.fill(dp[i], -1);
		}
		dp[0][0] = 0;
		for (int i = 0; i < twos.length; i++) {
			long[][] newDP = new long[max+1][totalFives+1];
			for (int j = 0; j < dp.length; j++) {
				Arrays.fill(newDP[j], -1);
			}
			for (int j = 0; j < dp.length; j++) {
				for (int k = 0; k < dp[0].length; k++) {
					if (dp[j][k] == -1) continue;
					newDP[j][k] = Math.max(newDP[j][k], dp[j][k]);
					if (j != dp.length-1) newDP[j+1][(int) (k+fives[i])] =
							Math.max(newDP[j+1][(int) (k+fives[i])],
									dp[j][k]+twos[i]);
				}
			}
			dp = newDP;
		}
		
		long ans = 0;
		for (int i = 0; i < dp[0].length; i++) {
			ans = Math.max(ans, Math.min(i, dp[max][i]));
		}
		
		System.out.println(ans);
				
	}

}