B"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. The first line contains two integer numbers n and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89200, xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n). The second line contains n space-separated integer numbers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891018). Print maximal roundness of product of the chosen subset of length k. In the first example there are 3 subsets of 2 numbers. [50, xe2 x80 x894] has product 200 with roundness 2, [4, xe2 x80 x8920] -- product 80, roundness 1, [50, xe2 x80 x8920] -- product 1000, roundness 3. In the second example subset [15, xe2 x80 x8916, xe2 x80 x8925] has product 6000, roundness 3. In the third example all subsets has product with roundness 0. "...