B'Vasya likes taking part in Codeforces contests. When a round is over, Vasya follows all submissions in the system testing tab. There are n solutions, the i -th of them should be tested on a_i tests, testing one solution on one test takes 1 second. The solutions are judged in the order from 1 to n . There are k testing processes which test solutions simultaneously. Each of them can test at most one solution at a time. At any time moment t when some testing process is not judging any solution, it takes the first solution from the queue and tests it on each test in increasing order of the test ids. Let this solution have id i , then it is being tested on the first test from time moment t till time moment t + 1 , then on the second test till time moment t + 2 and so on. This solution is fully tested at time moment t + a_i , and after that the testing process immediately starts testing another solution. Consider some time moment, let there be exactly m fully tested solutions by this moment. There is a caption "System testing: d %" on the page with solutions, where d is calculated as d = round <= ft(100 cdot frac{m}{n} right), where round(x) = lfloor{x + 0.5} rfloor is a function which maps every real to the nearest integer. Vasya calls a submission interesting if there is a time moment (possibly, non-integer) when the solution is being tested on some test q , and the caption says "System testing: q %". Find the number of interesting solutions. Please note that in case when multiple processes attempt to take the first submission from the queue at the same moment (for instance, at the initial moment), the order they take the solutions does not matter. The first line contains two positive integers n and k ( 1 <= n <= 1000 , 1 <= k <= 100 ) standing for the number of submissions and the number of testing processes respective'...