Beautiful Scoreboard

Oleg is a well-known fan of programming contests. He knows every participant of every contest held over the last ten years, and for any participant he can say how many problems the team that included him solved at any contest. Oleg is also very fond of number theory.

In a programming contest scoreboard, teams are ordered by decreasing number of solved problems. Oleg calls a scoreboard beautiful if for every team the number of problems it solved is zero or a divisor of the number of problems in the contest. When a team submits a problem, the number of problems it has solved increases by one. No team can submit two or more problems at the same time, and two teams cannot submit a problem at the same time either.

Looking at a beautiful scoreboard, Oleg wondered: how many more problems can the teams submit in total so that after each submitted problem the scoreboard stays beautiful? Help him find out.

The first line of the input file contains two integers: $n$ and $m$, the number of teams and the number of problems in the contest, respectively ($1 \le n \le 100$, $1 \le m \le 10^9$). The second line contains $n$ integers in non-increasing order: for each team, the number of problems it solved. It is guaranteed that every nonzero number is a divisor of $m$.

Print one number to the output file: the maximum number of problems the teams can submit in total so that after each submitted problem the scoreboard stays beautiful.

In the example, the teams in 4th and 5th place can submit one problem each, the team in 6th place can submit three, and the team in 7th place can submit four. In total the teams can submit 9 problems this way.