Chocolate

Some number of chocolate pieces were prepared for a training camp. The camp had N participants and lasted for D days. The i-th participant (1 \leq i \leq N) ate one chocolate piece on each of the following days in the camp: the 1-st day, the (A_i + 1)-th day, the (2A_i + 1)-th day, and so on. As a result, there were X chocolate pieces remaining at the end of the camp. During the camp, nobody except the participants ate chocolate pieces.

Find the number of chocolate pieces prepared at the beginning of the camp.

Constraints

• 1 \leq N \leq 100
• 1 \leq D \leq 100
• 1 \leq X \leq 100
• 1 \leq A_i \leq 100 (1 \leq i \leq N)
• All input values are integers.

Input

Input is given from Standard Input in the following format:

N D X A_1 A_2 : A_N

Output

Find the number of chocolate pieces prepared at the beginning of the camp.

Examples

Input

3 7 1 2 5 10

Output

8

Input

2 8 20 1 10

Output

29

Input

5 30 44 26 18 81 18 6

Output

56

inputFormat

input values are integers.

Input

Input is given from Standard Input in the following format:

N D X A_1 A_2 : A_N

outputFormat

Output

Find the number of chocolate pieces prepared at the beginning of the camp.

Examples

Input

3 7 1 2 5 10

Output

8

Input

2 8 20 1 10

Output

29

Input

5 30 44 26 18 81 18 6

Output

56

样例

5
30 44
26
18
81
18
6

56