CF677A.Vanya and Fence

Vanya 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?

瓦尼亚和他的朋友们正沿着一道高度为 $h$ 的栅栏行走，他们不希望被守卫发现。为了实现这一目标，每位朋友的身高都不能超过 $h$。如果某个人的身高大于 $h$，他可以弯下腰，这样就一定不会被守卫注意到。第 $i$ 位朋友的身高为 $a_i$。

假设正常行走时每个人的宽度为 $1$，而弯腰行走时每个人的宽度为 $2$。朋友们希望边走边交谈，因此他们想排成一列行走。那么，使得朋友们能排成一列行走且不被守卫注意到的道路最小宽度是多少？

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.

输入的第一行包含两个整数 $n$ 和 $h$（$1 \leq n \leq 1000$，$1 \leq h \leq 1000$），分别表示朋友的数量和篱笆的高度。

第二行包含 $n$ 个整数 $a_i$（$1 \leq a_i \leq 2h$），其中第 $i$ 个数表示第 $i$ 个人的身高。

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

输出一个整数——道路的最小可能有效宽度。

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.

在第一个样例中，只有编号为 3 的人需要弯腰，因此所需的宽度为 $1 + 1 + 2 = 4$。

在第二个样例中，所有朋友的身高都足够矮，无需任何人弯腰，因此宽度 $1 + 1 + 1 + 1 + 1 + 1 = 6$ 已足够。

在第三个样例中，除最后一人外，其余所有人都需要弯腰。道路所需的最小宽度为 $2 + 2 + 2 + 2 + 2 + 1 = 11$。