Buses and Minibuses

Running a programming contest takes preparation from the organizers, and transporting the competitors is one of the recurring headaches. At a recent contest, Ricardinho watched the buses and minibuses that had brought the competitors stand in a single line, one behind another, while everyone got off. Every vehicle belonged to the same company, but the paint jobs differed. Ricardinho started wondering how many different lines that company could form with its buses and minibuses.

A bus is 10 meters long and a minibus is 5 meters long. Given the total length of the line, the number of colors available for minibuses, and the number of colors available for buses, count how many lines can be formed.

The line is ordered from front to back. Two lines are different if some position holds a different vehicle type or a different color. Vehicles of the same type and color are not distinguished from each other.

The first line contains three integers $N$, $K$ and $L$ separated by spaces. $N$ is the total length in meters of the line Ricardinho is considering, $K$ is the number of different colors for minibuses, and $L$ is the number of different colors for buses. $N$, $K$ and $L$ can be very large, so 64 bit integers are recommended.

Constraints

• $5 \le N \le 10^{15}$ and $N$ is a multiple of 5
• $1 \le K \le 10^{15}$
• $1 \le L \le 10^{15}$

The number of lines can be very large, so report its last six digits. Print exactly six digits on one line, padded with leading zeros when needed.