Under construction

Still being built. Things may change

Christmas Lottery

Time limit2sMemory limit1024 MB

Summary
For each receipt, count the full A-ruble parts of its amount, then print the total of those counts across all n receipts.
Level

Easy1 of 10

Topics
Implementation, Math
Solved
No attempts yet

Statement

Christmas is almost here, but the shelves at AKEI stores are still empty. To draw in shoppers, sales manager Anton came up with a promotion. For every AA rubles a customer spends, they receive one lottery ticket, or, as the ads put it, a chance to win a car.

However, not every cashier knew about the promotion, so some customers did not get the tickets they were owed. Now Anton receives a stack of receipts every day that need tickets. He has not slept for three nights and is exhausted.

Help him find how many tickets he must issue.

Input

The first line contains two integers nn and AA (1≤n≤10001 \le n \le 1000, 1≤A≤10001 \le A \le 1000): the number of receipts and the amount in rubles needed for one ticket. The second line contains nn integers, the total purchase amount on each receipt (1≤ai≤100001 \le a_i \le 10000). All prices are in rubles.

Output

Print the total number of tickets Anton must issue.

Examples2

  1. Example 1

    Input
    3 2
    1 2 4
    
    Expected output
    3
    
  2. Example 2

    Input
    2 3
    1 2
    
    Expected output
    0