Vanya and Fence

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem Statement

Vanya walks with $n$ friends along a fence of height $h$. Friend $i$ has height $a_i$.

• If $a_i\le h$, that friend walks normally and needs width $1$.
• If $a_i>h$, that friend bends down and needs width $2$.

They walk in one row. Compute the minimum road width required for the whole group.

Equivalently,

$$W=\sum_{i=0}^{n-1}\begin{cases} 1,&a_i\le h,\\ 2,&a_i>h. \end{cases}$$

Input

• The first line contains integers $n$ and $h$.
• The second line contains $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print the integer $W$.

Subtasks

Subtask 1 (100 points): $1\le n\le1000$; $1\le h\le1000$; $1\le a_i\le2h$.

Examples

Input

3 7
4 5 14

Output

4

Explanation

Heights $4$ and $5$ do not exceed $7$, so each contributes width $1$. Height $14>7$ contributes width $2$. Thus $W=1+1+2=4$.