B"XXI Berland Annual Fair is coming really soon! Traditionally fair consists of n booths, arranged in a circle. The booths are numbered 1 through n clockwise with n being adjacent to 1 . The i -th booths sells some candies for the price of a_i burles per item. Each booth has an unlimited supply of candies. Polycarp has decided to spend at most T burles at the fair. However, he has some plan in mind for his path across the booths: Polycarp's money is finite, thus the process will end once he can no longer buy candy at any booth. Calculate the number of candies Polycarp will buy. The first line contains two integers n and T ( 1 <= n <= 2 cdot 10^5 , 1 <= T <= 10^{18} ) -- the number of booths at the fair and the initial amount of burles Polycarp has. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ) -- the price of the single candy at booth number i . Print a single integer -- the total number of candies Polycarp will buy. Let's consider the first example. Here are Polycarp's moves until he runs out of money: No candy can be bought later. The total number of candies bought is 10 . In the second example he has 1 burle left at the end of his path, no candy can be bought with this amount. "...