Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Vanya and Fence

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVanya and his friends are walking along the fence of height *h* and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed *h*. If the height of some person is greater than *h* he can bend down and then he surely won't be noticed by the guard. The height of the *i*-th person is equal to *a*_{i}.

Consider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard?

Input

The first line of the input contains two integers *n* and *h* (1 ≤ *n* ≤ 1000, 1 ≤ *h* ≤ 1000) — the number of friends and the height of the fence, respectively.

The second line contains *n* integers *a*_{i} (1 ≤ *a*_{i} ≤ 2*h*), the *i*-th of them is equal to the height of the *i*-th person.

Output

Print a single integer — the minimum possible valid width of the road.

Examples

Input

3 7

4 5 14

Output

4

Input

6 1

1 1 1 1 1 1

Output

6

Input

6 5

7 6 8 9 10 5

Output

11

Note

In the first sample, only person number 3 must bend down, so the required width is equal to 1 + 1 + 2 = 4.

In the second sample, all friends are short enough and no one has to bend, so the width 1 + 1 + 1 + 1 + 1 + 1 = 6 is enough.

In the third sample, all the persons have to bend, except the last one. The required minimum width of the road is equal to 2 + 2 + 2 + 2 + 2 + 1 = 11.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/19/2021 08:55:40 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|