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?


-----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} ≤ 2h), 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.

Difficulty: interview

Starter code:

Solutions:
3
# Copyright (C) 2016 Sayutin Dmitry.
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 3
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; If not, see <http://www.gnu.org/licenses/>.

def main():
    n, h = list(map(int, input().split()))
    leng = 0
    for ai in map(int, input().split()):
        if ai <= h:
            leng += 1
        else:
            leng += 2

    print(leng)

main()


#from functools import cmp_to_key
#from collections import deque

def main():
    n,h = map(int,input().split())
    w = 0
    for i in input().split():
        if int(i) > h:
            w += 2
        else:
            w += 1
    print(w)


def __starting_point():
    main()
__starting_point()

n,h = (int(i) for i in input().split())
ans = 0
l = list(map(int,input().split()))
for i in range(n):
    if l[i] > h:
        ans+=2
    else:
        ans+=1
print(ans)

n, h = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
for x in a:
    if x > h:
        ans += 2
    else:
        ans += 1
print(ans)


n, h = list(map(int,input().split()))
ai = list(map(int,input().split()))
ans = 0
for i in range(n):
    if ai[i] > h:
        ans += 2
    else:
        ans += 1
print(ans)


n, h = list(map(int, input().split()))
a = list(map(int, input().split()))
w = 0
for k in a:
    if k > h:
        w += 2
    else:
        w += 1
print(w)


n,h=list(map(int,input().split()))
print(sum(1 if x<=h else 2 for x in map(int,input().split())))


n, h = map(int, input().split())
print(sum(1 + (int(ai) > h) for ai in input().split()))

n, h = list(map(int, input().split()))
a = list(map(int, input().split()))
w = 0
for i in a:
    if i > h:
        w += 2
    else:
        w += 1
print(w)


n,h=list(map(int,input().split()))
ip=list(map(int,input().split()))
width=0
for i in range(n):
    if ip[i]>h:
        width+=2
    else:
        width+=1
print(width)


n, h = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in a:
    ans += (i + h - 1) // h
print(ans)

n, h = list(map(int, input().split()))
tab = list(map(int, input().split()))
print(sum([1 if x <= h else 2 for x in tab]))


n,h = [int(x) for x in input().split(' ')]
ai = [int(x) for x in input().split(' ')]

c = 0

for i in range(n):
	if ai[i] > h:
		c += 2
	else:
		c += 1

print(c)

read = lambda: list(map(int, input().split()))
n, h = read()
a = list(read())
ans = n + sum(i > h for i in a)
print(ans)


n, h = list(map(int, input().split()))
pr = 0
for s in input().split():
    if int(s) > h:
        pr += 1
print(n + pr)


n, h = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
print(sum([1 if x <= h else 2 for x in A]))


n,h = [int(x) for x in input().split()]
L = [int(x) for x in input().split()]
w=len(L)
for i in L:
    if i>h:
        w+=1
print(w)


n, h = list(map(int, input().split()))
l = list(map(int, input().split()))

sm = 0
for x in l:
	sm += 1
	if x > h:
		sm += 1
print(sm)

3

n, h = list(map(int, input().split()))

a = list(map(int, input().split()))

ans = n

for i in range(n):
    if a[i] > h:
        ans += 1

print(ans)


n,h=map(int,input().split())
ans=n
for x in list(map(int,input().split())):
    if x>h: ans+=1
print(ans)

n, h = list(map(int, input().split()))

arr = list(map(int, input().split()))

print(sum(1 if h >= x else 2 for x in arr))


n, h = list(map(int, input().split()))
a = list(map(int, input().split()))

print(n + sum(x > h for x in a))



n,h=map(int,input().split())
arr=list(map(int,input().split()))
count=n
for i in range(n):
	if(arr[i]>h):
		count+=1
print(count)

n, h = list(map(int, input().split()))
a = list(map(int, input().split()))

w = 0

for friend in a:
    if friend <= h:
        w += 1
    else:
        w += 2
print(w)


N, h = list(map(int, input().split()))
print(sum(2 if a > h else 1 for a in [int(x) for x in input().split()]))