The Great Combinator
As a result of yet another clever scheme, Ostap Bender and his companions, the K children of Lieutenant Schmidt, have acquired X rubles in five-ruble banknotes. Now, as usual, it's time to divide the money...
Shura Balaganov suggested dividing it "fairly," meaning equally among everyone. Panikovsky wanted to take half for himself and distribute the rest "according to merit." Each of the K children had their own interesting proposals. However, the Great Combinator had his own ideas...
Your task is to determine the number of ways to distribute the available money among all the participants of this significant event: the K children of Lieutenant Schmidt and Ostap Bender.
Input
The input file contains two integers: X (0 ≤ X ≤ 500) and K (0 ≤ K ≤ 100). It is given that X is divisible by 5. Additionally, tearing the five-ruble banknotes is not allowed during the division.
Output
Output a single integer representing the number of ways to divide the money.