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: EASY
Tags: Implementation

Starter code:

Solutions:
(n, h) = list(map(int, input().split()))
arr = list(map(int, input().split()))
sum = 0
for i in arr:
	if i <= h:
		sum = sum + 1
	if i > h:
		sum = sum + 2
print(sum)


(a, b) = map(int, input().split())
c = [int(i) for i in input().split()]
d = 0
for i in c:
	if i <= b:
		d += 1
	else:
		d += 2
print(d)


(n, m) = map(int, input().split())
print(n + sum((int(i) > m for i in input().split())))


friends_height = list(map(int, input().split()))
heights = list(map(int, input().split()))
road_width = 0
for i in heights:
	if i > friends_height[1]:
		road_width += 2
	else:
		road_width += 1
print(str(road_width))


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


def get():
	return [int(x) for x in input().split()]
(n, h) = get()
print(n + sum((x > h for x in get())))


[n, h] = [int(x) for x in input().split()]
heights = [int(x) for x in input().split()]
width = 0
i = 0
while i < n:
	if heights[i] > h:
		width += 2
	else:
		width += 1
	i += 1
print(width)


(a, b) = input().split()
a = int(a)
b = int(b)
c = input().split()
h = 0
for i in range(a):
	if int(c[i]) <= b:
		h += 1
	else:
		h += 2
print(h)


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


(n, h) = input().split()
n = int(n)
h = int(h)
c = 0
x = input()
a = x.split()
for i in range(0, len(a)):
	if int(a[i]) > h:
		c = c + 2
	else:
		c = c + 1
print(c)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
c = 0
for i in range(n):
	if a[i] <= h:
		c += 1
	elif a[i] > h:
		c += 2
print(c)


x = list(map(int, input().split(' ')))
l = list(map(int, input().split(' ')))
c = 0
for i in l:
	if i <= x[1]:
		c = c + 1
	if i > x[1]:
		c = c + 2
print(c)


(n, h) = map(int, input().split())
arr = list(map(int, input().split(' ')))
width = 0
for i in arr:
	if i <= h:
		width += 1
	else:
		width += 2
print(width)


(n, h) = map(int, input().split())
friends = list(map(int, input().split()))
tall = [1 for height in friends if height > h]
print(n + len(tall))


(x, y) = map(int, input().split())
a = map(int, input().split())
ans = 0
for z in a:
	if z <= y:
		ans += 1
	else:
		ans += 2
print(ans)


(n, b) = [int(i) for i in input().split()]
a = [int(x) for x in input().split()]
for i in a:
	if i > b:
		n += 1
print(n)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))[:n]
c1 = 0
c2 = 0
for i in range(len(a)):
	if a[i] <= h:
		c1 = c1 + 1
	else:
		c2 = c2 + 2
print(c1 + c2)


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


n = input()
m = input()
a = []
b = []
a = n.split(' ')
b = m.split(' ')
j = int(a[0])
l = int(a[1])
ans = j
for i in range(len(b)):
	if int(b[i]) > l:
		ans += 1
print(ans)


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


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


numbers = list(map(int, input().split()))
numbers2 = list(map(int, input().split()))
count = 0
for i in range(len(numbers2)):
	if numbers2[i] > numbers[1]:
		count += 2
	else:
		count += 1
print(count)


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


h = int(input().split()[1])
h_s = input().split()
print(sum([int(int(i) > h) + 1 for i in h_s]))


(_, h) = map(int, input().split())
arr = map(int, input().split())
res = 0
for a in arr:
	if a <= h:
		res += 1
	else:
		res += 2
print(res)


l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
c = 0
for i in range(len(l2)):
	if l2[i] <= l1[1]:
		c = c + 1
	else:
		c = c + 2
print(c)


(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
r = 0
for friend in arr:
	r += 2 if friend > k else 1
print(r)


h = input()
a = input()
a = list(map(int, a.split()))
h = list(map(int, h.split()))
n = len(a)
c = []
x = 0
while x < n:
	if a[x] > int(h[1]):
		c.append(2)
	else:
		c.append(1)
	x = x + 1
w = sum(c)
print(w)


def main():
	(n, k) = [int(i) for i in input().split()]
	x = [int(i) for i in input().split()]
	res = 0
	res += sum((2 for i in x if i > k))
	res += sum((1 for i in x if i <= k))
	print(res)
main()


(n, m) = input().strip().split()[:2]
n = int(n)
m = int(m)
l = list(map(int, input().strip().split()[:n]))
width = 0
for x in l:
	if x <= m:
		width += 1
	else:
		width += 2
print(width)


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


n = input().split(' ')
k = int(n[0])
t = int(n[1])
p = input().split(' ')
count = 0
for i in range(len(p)):
	if int(p[i]) > t:
		count += 2
	else:
		count += 1
print(count)


(n, h) = [int(x) for x in input().split()]
l = [int(u) for u in input().split()]
w = 0
for i in l:
	if i > h:
		w += 2
	else:
		w += 1
print(w)


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


(n, m) = map(int, input().split())
a = [int(x) for x in input().split()]
cum = 0
for i in range(n):
	if a[i] <= m:
		cum += 1
	else:
		cum += 2
print(cum)


(n, m) = map(int, input().split())
x = sum((1 + (a > m) for a in map(int, input().split())))
print(x)


(friends, height) = map(int, input().split())
heights = map(int, input().split())
print(sum([[2, 1][h <= height] for h in heights]))


inputs = []
width = 0
for _ in range(2):
	inputs.append(list(map(int, input().split())))
for i in inputs[1]:
	if i <= inputs[0][1]:
		width += 1
	else:
		width += 2
print(width)


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


line = input()
(n, h) = (int(x) for x in line.split())
count = n
line = input().split()
for i in range(n):
	currHeight = int(line[i])
	if currHeight > h:
		count += 1
print(count)


temp = input()
number_of_friends = int(temp.split()[0])
height_of_fence = int(temp.split()[1])
height_of_friends = input().split()
width = 0
for i in range(number_of_friends):
	if int(height_of_friends[i]) > height_of_fence:
		width += 2
	else:
		width += 1
print(width)


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
count = 0
for e in a:
	if e > m:
		count += 2
	else:
		count += 1
print(count)


first_line = [int(x) for x in input().split()]
n = first_line[0]
h = first_line[1]
second_line = [int(y) for y in input().split()]
counter = 0
for i in range(n):
	if second_line[i] <= h:
		counter += 1
	else:
		counter += 2
print(counter)


a = input().split(' ')
b = input().split(' ')
for i in range(len(a)):
	a[i] = int(a[i])
for i in range(len(b)):
	b[i] = int(b[i])
n = a[0]
h = a[1]
counter = 0
for i in b:
	counter += 2 if i > h else 1
print(counter)


(frds_num, h) = input().split()
frds = input().split()
w = 0
for frd in frds:
	if int(frd) > int(h):
		w += 2
	else:
		w += 1
print(w)


def solve(n, inp):
	ans = 0
	for i in inp:
		if i > n:
			ans += 2
		else:
			ans += 1
	return ans
n = int(input().split()[1])
inp = [int(i) for i in input().split()]
print(solve(n, inp))


(a, b) = map(int, input().split())
c = 0
l = list(map(int, input().split()))
for i in range(a):
	if l[i] <= b:
		c += 1
	else:
		c += 2
print(c)


(n, h) = [int(x) for x in input().split(' ')]
a = [int(x) for x in input().split(' ')]
ans = 0
for f in a:
	if f <= h:
		ans += 1
	else:
		ans += 2
print(ans)


(n, wall) = map(int, input().split())
heights = list(map(int, input().split()))
width = 0
for i in heights:
	if i > wall:
		width += 2
	else:
		width += 1
print(width)


(n, h) = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
w = []
for i in a:
	if i <= h:
		w.append(1)
	else:
		w.append(2)
result = sum(w)
print(result)


(a, b) = map(int, input().split())
arr = input().split()
cnt = 0
for i in arr:
	if int(i) > b:
		cnt += 2
	else:
		cnt += 1
print(cnt)


(x, y) = map(int, input().split())
z = 0
l = list(map(int, input().split()))
for i in l:
	if i > y:
		z += 2
	else:
		z += 1
print(z)


(n, k) = [int(tmp) for tmp in input().split()]
x = list(map(int, input().split()))
ans = 0
for i in range(n):
	if x[i] <= k:
		ans += 1
	else:
		ans += 2
print(ans)


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


(m, s) = list(map(int, input().split()))
l = list(map(int, input().split()))
x = list(map(lambda x: x > s, l))
print(x.count(False) + x.count(True) * 2)


k = input().split()
n = int(k[0])
h = int(k[1])
a = input().split()
width = 0
for i in a:
	if int(i) > h:
		width += 2
	else:
		width += 1
print(width)


inps = input()
x = inps.split(' ')
n = int(x[0])
h = int(x[1])
w = 0
nums = input()
a = nums.split(' ')
for i in range(n):
	if int(a[i]) <= h:
		w += 1
	else:
		w += 2
print(w)


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


def width(h, arr):
	w = 0
	for i in arr:
		if i > h:
			w += 2
		else:
			w += 1
	return w
(n, h) = map(int, input().strip().split(' '))
arr = list(map(int, input().strip().split(' ')))
print(width(h, arr))


from sys import stdin, stdout

def main():
	(num, height) = stdin.readline().split()
	num = int(num)
	height = int(height)
	count = num
	fh = stdin.readline().split()
	for i in range(0, int(num)):
		if int(fh[i]) > height:
			count += 1
	return count
stdout.write(str(main()))


(n, h) = map(int, input().split())
a = [int(x) for x in input().split()]
c = 0
for i in range(n):
	if a[i] > h:
		c += 1
print(n + c)


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


(n, h) = map(int, input().split())
array = list(map(int, input().split()))
ans = 0
for value in array:
	if value <= h:
		ans += 1
	else:
		ans += 2
print(ans)


def solve(n, h, heights):
	width = 0
	for height in heights:
		if height > h:
			width += 2
		else:
			width += 1
	return width
(n, h) = map(int, input().split())
if (1 <= n, h <= 1000):
	heights = map(int, input().split())
print(solve(n, h, heights))


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


(num_friends, fence) = [int(x) for x in input().split()]
friends = input().split()
length = 0
if len(friends) <= num_friends:
	for person in friends:
		if int(person) > fence:
			length += 2
		else:
			length += 1
print(length)


(x, y) = [int(i) for i in input().split()]
z = [int(i) for i in input().split()]
f = 0
for i in z:
	if i < y:
		f += 1
	elif i == y:
		f += 1
	elif i > y:
		f += 2
print(f)


(n, h) = list(map(int, input().strip().split()))
A = list(map(int, input().strip().split()))
width = 0
for height in A:
	if height <= h:
		width += 1
	else:
		width += 2
print(width)


(_, b) = [int(s) for s in input().split()]
a = [int(s) for s in input().split()]
c = 0
for i in a:
	if i > b:
		c += 2
	else:
		c += 1
print(c)


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


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


from sys import stdin, stdout
(no_of_friends, fence_height) = map(int, stdin.readline().split())
friends = map(int, stdin.readline().split())
count = 0
for f in friends:
	if f <= fence_height:
		count += 1
	else:
		count += 2
stdout.write(str(count))


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


def min_poss():
	a = list(map(int, input().strip(' ').split(' ')))
	sum = 0
	w_person = list(map(int, input().strip(' ').split(' ')))
	for i in range(len(w_person)):
		if w_person[i] <= a[1]:
			sum += 1
		else:
			sum += 2
	print(sum)
min_poss()


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


a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
for i in b:
	if i > a[1]:
		count += 2
	else:
		count += 1
print(count)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
width = 0
for i in l:
	if i <= h:
		width = width + 1
	elif i > h:
		width = width + 2
print(width)


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


(n, h) = map(int, input().split())
q = list(map(int, input().split()))
c = 0
for i in q:
	if i <= h:
		c += 1
	else:
		c += 2
print(c)


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


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
c = 0
for i in l:
	if i > k:
		c += 2
	else:
		c += 1
print(c)


x = input().split()
y = input().split()
z = []
sum = 0
for ind in y:
	z.append(ind)
for i in y:
	if int(i) <= int(x[1]):
		sum = sum + 1
	if int(i) > int(x[1]):
		sum = sum + 2
print(sum)


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


(n, h) = [int(x) for x in input().split()]
l = [int(y) for y in input().split()]
s = 0
for i in l:
	if i <= h:
		s += 1
	else:
		s += 2
print(s)


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


(n, h) = map(int, input().split())
arr = map(int, input().split())
sum = 0
for j in arr:
	if j > h:
		sum += 2
	else:
		sum += 1
print(sum)


(n, m) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
t = 0
for i in range(n):
	if l[i] % m == 0:
		t = t + l[i] // m
	else:
		t = t + l[i] // m + 1
print(t)


while True:
	try:
		(n, h) = map(int, input().split())
		heights = list(map(int, input().split()))
		width = 0
		for height in heights:
			if height > h:
				width += 2
			else:
				width += 1
		print(width)
	except EOFError:
		break


(n, h) = map(int, input().split())
person = list(map(int, input().split()))
double = 0
single = 0
for i in person:
	if i > h:
		double += 2
	elif i <= h:
		single += 1
print(single + double)


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


(n, h) = (int(i) for i in input().split(' '))
a = [int(i) for i in input().split(' ')]
answer = 0
for i in a:
	if i > h:
		answer += 2
	else:
		answer += 1
print(answer)


def read_line_into_int_list():
	return [int(i) for i in input().split()]
(n, h) = read_line_into_int_list()
a = read_line_into_int_list()
at = 0
for ai in a:
	if ai > h:
		at += 1
print(n + at)


(a, b) = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
ans = 0
for i in c:
	if i <= b:
		ans += 1
	else:
		ans += 2
print(ans)


(n, h) = map(int, input().split())
arr = map(int, input().split())
print(n + len(list(filter(lambda x: x > h, arr))))


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


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


a = input().split()
b = input().split()
count = 0
for i in range(int(a[0])):
	if int(b[i]) <= int(a[1]):
		count += 1
	else:
		count += 2
print(count)


import sys
(n, h) = sys.stdin.readline()[:-1].split()
(n, h) = (int(n), int(h))
heights = sys.stdin.readline()[:-1].split()
output = 0
for i in range(n):
	if int(heights[i]) > h:
		output += 2
	else:
		output += 1
print(output)


(Num, Height) = map(int, input().split())
arr = [int(i) for i in input().split()]
Total = 0
for i in range(0, len(arr)):
	if arr[i] > Height:
		Total += 2
	else:
		Total += 1
print(Total)


(n, m) = input().strip().split(' ')
(n, m) = [int(n), int(m)]
height = map(int, input().strip().split(' '))
width = 0
for i in height:
	if i > m:
		width += 2
	else:
		width += 1
print(width)


def invr():
	return map(int, input().split())
(n, h) = invr()
a = list(invr())
w = 0
for i in range(n):
	if a[i] <= h:
		w += 1
	else:
		w += 2
print(w)


(x, h) = [int(x) for x in input().split(' ')]
hs = [int(x) for x in input().split(' ')]
cnt = 0
for p in hs:
	if p > h:
		cnt += 2
	else:
		cnt += 1
print(cnt)


(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
w = 0
for ai in a:
	if ai <= h:
		w += 1
	else:
		w += 2
print(w)


(n, h) = map(int, input().split())
a = [int(i) for i in input().split()]
tall = 0
for i in a:
	if i > h:
		tall += 1
print(n - tall + 2 * tall)


def solve():
	(n, h) = [int(s) for s in input().split()]
	mas = [int(s) for s in input().split()]
	ans = 0
	for i in range(n):
		if mas[i] > h:
			ans += 2
		else:
			ans += 1
	print(ans)
solve()


(n, fence) = [int(x) for x in input().split(' ')]
heights = [int(x) for x in input().split(' ')]
count = 0
for i in heights:
	if i <= fence:
		count += 1
	else:
		count += 2
print(count)


def faster():
	var1 = list(map(int, input().split()))
	var2 = list(map(int, input().split()))
	if var1[0] == 1:
		if var2[0] > var1[1]:
			return 2
		else:
			return 1
	count = 0
	for i in range(0, var1[0], 1):
		if var2[i] > var1[1]:
			count = count + 2
		else:
			count = count + 1
	return count
print(faster())


(n, b) = map(int, input().split())
a = list(map(int, input().split()))
for i in a:
	if i > b:
		n += 1
print(n)


I = lambda : map(int, input().split())
(n, h) = I()
print(n + sum([i > h for i in I()]))


line1 = input()
n = int(line1.split(' ')[0])
h = int(line1.split(' ')[1])
line2 = input()
line2 = line2.split(' ')
count = 0
for i in range(0, n):
	if int(line2[i]) <= h:
		count += 1
	else:
		count += 2
print(count)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
b = list(filter(lambda x: x <= h, a))
c = list(filter(lambda x: x > h, a))
print(len(b) + 2 * len(c))


nh = [int(x) for x in input().split()]
(n, h) = (nh[0], nh[1])
ls = [1 for x in input().split() if int(x) > h]
print(n + sum(ls))


x = input()
n = int(x.split(' ')[0])
h = int(x.split(' ')[1])
min = 0
x = input()
for y in x.split(' '):
	if int(y) <= h:
		min += 1
	else:
		min += 2
print(min)


x = input()
(n, h) = (int(x.split()[0]), int(x.split()[1]))
y = input()
count = 0
values = [int(i) for i in y.split()]
for i in values:
	if i > h:
		count += 2
	else:
		count += 1
print(count)


import math
import os
import random
import re
import sys
total = 0
n = input().rstrip().split()
number = n[0]
height = n[1]
a = [int(1) if int(x) <= int(height) else int(2) for x in input().split()]
print(sum(a))


(n, h) = map(int, input().split())
a = [int(a) for a in input().split()]
t = []
for i in range(n):
	if a[i] > h:
		a[i] = 2
		t.append(2)
	else:
		a[i] = 1
		t.append(1)
print(sum(t))


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


T = list(map(int, input().split()))
a = list(map(int, input().split()))
w = 0
for i in a:
	if i <= T[1]:
		w = w + 1
	else:
		w = w + 2
print(w)


def minimumWidth(heightOfFence, friendsHeight):
	minimum = 0
	for height in friendsHeight:
		if height > heightOfFence:
			minimum = minimum + 2
		else:
			minimum = minimum + 1
	return minimum
numAndHeight = list(map(int, input().split()))
friendsHeight = list(map(int, input().split()))
print(minimumWidth(numAndHeight[1], friendsHeight))


class Main:
	(n, h) = input().split(' ')
	a = input().split(' ')
	(n, h) = (int(n), int(h))
	for i in range(0, n):
		a[i] = int(a[i])
	bend = 0
	for height in a:
		if height > h:
			bend += 1
	width = n + bend
	print(width)
Main()


(n, h) = input().split()
arr = input().split()
counter = 0
for i in arr:
	if int(h) >= int(i):
		counter += 1
	if int(h) < int(i):
		counter += 2
print(counter)


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


(a, b) = map(int, input().split())
ar = list(map(int, input().split()))
su = 0
for i in ar:
	if i > b:
		su += 2
	else:
		su += 1
print(su)


(number, height) = map(int, input().split())
people = map(int, input().split())
print(sum((2 if i > height else 1 for i in people)))


(x, y) = map(int, input().split())
a = list(map(int, input().split()))
n = 0
for i in range(x):
	if a[i] <= y:
		n += 1
	else:
		n += 2
print(n)


(num, hieght) = map(int, input().split())
result = 0
lst = list(map(int, input().split()))
for i in range(num):
	if lst[i] > hieght:
		result += 2
	else:
		result += 1
print(result)


(a, b) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
j = 0
for i in l:
	if i <= b:
		j = j + 1
	else:
		j += 2
print(j)


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


(n, h) = input().split()
n = int(n)
h = int(h)
a = [int(a) for a in input().split()]
width = 0
for cur in a:
	width += 1 + (cur > h)
else:
	print(width)


(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)


in_arr = input().split(' ')
n = int(in_arr[0])
h = int(in_arr[1])
arr = input().split(' ')
tot = 0
for i in range(0, n):
	if int(arr[i]) > h:
		tot += 2
	else:
		tot += 1
print(tot)


(n, h) = map(int, input().split())
l = map(lambda x, h=h: 2 if x > h else 1, map(int, input().split()))
print(sum(l))


z = [input()]
z = z[0].split()
result = 0
y = [input()]
y = y[0].split()
for i in range(0, len(y)):
	if int(y[i]) > int(z[-1]):
		result += 2
	else:
		result += 1
print(result)


(x, y) = map(int, input().split())
n = map(int, input().split())
res = 0
for i in n:
	if i > y:
		res += 2
	else:
		res += 1
print(res)


(n, k) = [int(n) for n in input().split()]
a = [int(n) for n in input().split()]
m = 0
for i in range(n):
	if a[i] > k:
		m = m + 1
print(int(n + m))


(n, h) = map(int, input().split(' '))
sum = 0
a = 0
for a in list(map(int, input().split())):
	if a <= h:
		sum += 1
	else:
		sum += 2
print(sum)


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


def width(fence, heights):
	width = 0
	for person in heights:
		if int(person) > int(fence):
			width = width + 2
		else:
			width = width + 1
	return width
fence = input().split()[1]
people = input().split()
print(width(fence, people))


from sys import stdin

def input():
	return stdin.readline()
(n, h) = map(int, input().split())
hs = map(int, input().split())
ans = n
for i in hs:
	if i > h:
		ans += 1
print(ans)


def func(s):
	(n, h) = (int(s[0]), int(s[1]))
	l1 = [x for k in [list(map(int, i)) for i in [input().split()]] for x in k]
	count = 0
	for i in l1:
		if i <= h:
			count += 1
		else:
			count += 2
	return count
print(func(input().split()))


(n, k) = (int(i) for i in input().split())
a = [int(i) for i in input().split()]
s = 0
for i in a:
	if i <= k:
		s += 1
	else:
		s += 2
print(s)


a = list(map(int, input().split()))
h = list(map(int, input().split()))
h_z = a[1]
i = 0
otv = 0
for i in range(len(h)):
	if h[i] <= h_z:
		otv += 1
	else:
		otv += 2
print(otv)


try:
	(n, h) = map(int, input().split())
	l = list(map(int, input().split()))
	s = 0
	for i in l:
		if i > h:
			s += 2
		else:
			s += 1
	print(s)
except:
	pass


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
j = len([i for i in l if i > h])
print(n - j + j * 2)


m = map(int, input().split())
x = map(int, input().split())
s = 0
mm = []
for i in m:
	mm.append(i)
xx = []
for i in x:
	xx.append(i)
for i in range(mm[0]):
	if xx[i] > mm[1]:
		s += 2
	else:
		s += 1
print(s)


(n, m) = map(int, input().split())
li = list(map(int, input().split()))
ki = []
di = 0
for i in range(len(li)):
	if li[i] < m:
		ki.append(1)
	elif li[i] == m:
		ki.append(1)
	else:
		ki.append(2)
for j in range(len(ki)):
	di = di + ki[j]
print(di)


x = input()
x = x.split()
y = input()
y = y.split()
sum = 0
for guy in y:
	if int(guy) > int(x[1]):
		sum += 2
	else:
		sum += 1
print(sum)


(k, v) = input().split()
n = int(k)
h = int(v)
people = list(map(int, input().split()))
lists = []
lists[:0] = people
lists = [x for x in lists if x != ' ']
lenlists = len(lists)
answer = 0
for j in range(0, lenlists):
	if int(lists[j]) > h:
		answer += 2
	elif int(lists[j]) <= h:
		answer += 1
print(answer)


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


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


(m, n) = [int(x) for x in input().split()]
high = [int(y) for y in input().split()]
a = 0
for i in range(m):
	if high[i] <= n:
		a += 1
	else:
		a += 2
print(a)


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


(amount, higth) = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
count = 0
for i in range(amount):
	if h[i] > higth:
		count += 2
	else:
		count += 1
print(count)


q = input()
q = q.split()
n = int(q[0])
h = int(q[1])
ei = input()
ei = ei.split()
w = 0
for i in ei:
	i = int(i)
	if i > h:
		w = w + 2
	if i <= h:
		w = w + 1
print(w)


from functools import reduce
(n, h) = map(int, input().split())
p = reduce(lambda x, y: x + int(y > h), map(int, input().split()), 0)
print(n + p)


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


(n_people, fence_h) = list(map(int, input().split(' ')))
people_h = list(map(int, input().split(' ')))
width = 0
for i in range(n_people):
	if people_h[i] > fence_h:
		width += 2
	else:
		width += 1
print(width)


try:
	(a, b) = map(int, input().split())
	ar = list(map(int, input().split()))
	c = 0
	for i in ar:
		if i > b:
			c += 2
		else:
			c += 1
	print(c)
except:
	pass


def _677A(heights, max_height):
	width = 0
	for height in heights:
		if height > max_height:
			width += 1
		width += 1
	return width
(n, max_height) = list(map(lambda x: int(x), input().split()))
heights = list(map(lambda x: int(x), input().split()))
print(_677A(heights, max_height))


l1 = input().split()
num = int(l1[0])
h = int(l1[1])
l2 = input().split()
w = 0
for _ in l2:
	if int(_) <= h:
		w += 1
	else:
		w += 2
print(w)


import sys
numbers = [int(i) for i in sys.stdin.readline().split()]
n = numbers[0]
h = numbers[1]
a = [int(i) for i in sys.stdin.readline().split()]
width_total = 0
for i in a:
	if i > h:
		width_total += 2
	else:
		width_total += 1
print(width_total)


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


(n, h) = input().split()
x = input().split()
c = 0
for i in x:
	if int(i) > int(h):
		c = c + 2
	else:
		c = c + 1
print(c)


(n, m) = input().split()
m = int(m)
t = []
l = list(map(int, input().split()))
for i in l:
	if i <= m:
		t.append(1)
	else:
		t.append(2)
print(sum(t))


(n, h) = [int(x) for x in input().split()]
min = n
for height in input().split():
	if int(height) > h:
		min += 1
print(min)


def Get_Minimum():
	(n, h) = input().split(' ')
	l = []
	[l.append(num) for num in input().split(' ')]
	l = list(map(int, l))
	sum = 0
	for j in l:
		if j <= int(h):
			sum += 1
		else:
			sum += 2
	print(sum)
Get_Minimum()


(person, fence_height) = map(int, input().split())
heights = map(int, input().split())
width = 0
for height in heights:
	if height > fence_height:
		width += 2
	else:
		width += 1
print(width)


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


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


(n, h) = map(int, input().split())
wid = n
friends = [int(x) for x in input().split()]
for i in range(n):
	if friends[i] > h:
		wid += 1
print(wid)


(n, h) = map(int, input().split())
A = [int(x) for x in input().split()]
cnt = 0
for i in A:
	if i > h:
		cnt += 1
print(cnt * 2 + n - cnt)


n = list(map(int, input().split()))
ans = 0
arr = list(map(int, input().split()))
for i in range(n[0]):
	if n[1] < arr[i]:
		ans += 2
	else:
		ans += 1
print(ans, end='')


(n, h) = map(int, input().split())
inputs = []
width = 0
inputs = [int(x) for x in input().split()]
for i in range(0, len(inputs)):
	if inputs[i] > h:
		width = width + 2
	else:
		width = width + 1
print('%d' % width)


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


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


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


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


def tofence(a, b, height):
	width = 0
	for i in height:
		if i > b:
			width += 2
		else:
			width += 1
	print(width)
(a, b) = map(int, input().split())
height = list(map(int, input().split()))
tofence(a, b, height)


(n, h) = map(int, input().split())
mas = [int(x) for x in input().split()]
p = 0
for i in mas:
	if i <= h:
		p += 1
	else:
		p += 2
print(p)


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


(n, h) = map(int, input().split())
arreglo = list(map(int, input().split()))
total = 0
for i in arreglo:
	if i <= h:
		total += 1
	else:
		total += 2
print(total)


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


def main():
	(n, h) = list(map(int, input().split()))
	width = 0
	ht = list(map(int, input().split()))
	for i in ht:
		if i > h:
			width += 1
		width += 1
	print(width)
main()


a = input()
b = input()
c = a.split()
d = b.split()
bent = 0
for i in d:
	if int(i) > int(c[1]):
		bent += 1
print(bent + int(c[0]))


n = input().split(' ')
b = input().split(' ')
c = 0
for i in range(int(n[0])):
	if int(b[i]) > int(n[1]):
		c = c + 1
print(c + int(n[0]))


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


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


(n, h) = map(int, input().split())
a = list(map(int, input().split(' ')))
w = []
for j in a:
	if j > h:
		width = 2
	else:
		width = 1
	w.append(width)
print(sum(w))


line = input('')
n = int(line.split()[0])
h = int(line.split()[1])
persons = input('').split()
answer = 0
for i in persons:
	if int(i) > h:
		answer = answer + 2
	else:
		answer = answer + 1
print(answer)


NH = list(map(int, input().strip().split()))
n = NH[0]
h = NH[1]
sum = 0
list = list(map(int, input().strip().split()))
for item in list:
	if item <= h:
		sum += 1
	else:
		sum += 2
print(sum)


from sys import stdin, stdout
inp = lambda : (int(o) for o in stdin.readline().split())
sinp = lambda : (o for o in stdin.readline().split())
out = lambda : stdout.write(str(ans))
(n, h) = inp()
a = list(inp())
ans = 0
for i in range(n):
	if a[i] > h:
		ans += 2
	else:
		ans += 1
out()


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


(n, h) = map(int, input().split())
l = sum(map(lambda x: 1 + (int(x) - 1) // h, input().split()))
print(l)


import sys
import math
(n, h) = input().split()
a = [int(x) for x in input().split()]
width = 0
for i in a:
	if i > int(h):
		width += 2
	else:
		width += 1
print(width)


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


(n, h) = input().split()
A = input().split()
c = 0
for a in A:
	if int(a) > int(h):
		c = c + 2
	else:
		c = c + 1
print(c)


(n, h) = map(int, input().split())
ar = list(map(int, input().split()))
m2 = 0
for a in ar:
	if a > h:
		m2 += 1
m1 = len(ar) - m2
print(m2 * 2 + m1)


(friends, limit) = map(int, input().split())
hight = [int(h) for h in input().split()]
w = 0
for i in hight:
	if i > limit:
		w += 2
	else:
		w += 1
print(w)


import math
import sys
for s in sys.stdin:
	n = list(map(int, str(s).split(' ')))
	num = list(map(int, str(input()).split(' ')))
	tot = 0
	for i in range(0, len(num)):
		tot += math.ceil(num[i] / n[1])
	print(tot)


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


(n, h) = input().split()
n = int(n)
h = int(h)
l = []
w = 0
l = list(map(int, input().split()))
for i in l:
	k = i // h
	r = i % h
	if r != 0:
		w = w + 1
	if k != 0:
		w = w + k
print(w)


(n, h) = [int(x) for x in input().split()]
hs = [int(x) for x in input().split()]
n_friends = len(hs)
n_s = sum([1 for x in hs if x > h])
n_p = n_friends - n_s
print(n_s * 2 + n_p)


import sys
(n, h) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
result = n
for ah in a:
	if ah > h:
		result += 1
print(result)


import sys
(n, h) = map(int, sys.stdin.readline().split())
heights = map(int, sys.stdin.readline().split())
ans = 0
for height in heights:
	if height > h:
		ans += 2
	else:
		ans += 1
print(str(ans))


nbr_fence = input().split(' ')
list = input().split(' ')
r = 0
a = int(nbr_fence[0])
for i in range(a):
	if int(list[i]) <= int(nbr_fence[1]):
		r += 1
	else:
		r += 2
print(r)


[n, h] = map(int, input().split())
check = list(map(int, input().split()))
count = 0
for _ in range(n):
	if check[_] <= h:
		count += 1
	else:
		count += 2
print(count)


sum1 = 0
(m, n) = map(int, input().split())
l = list(map(int, input().split()))
for i in l:
	if i <= n:
		sum1 += 1
	else:
		sum1 += 2
print(sum1)


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


s = input().split()
(n, h) = (int(s[0]), int(s[1]))
s = input().split()
out = n
for i in range(n):
	if eval(s[i]) > h:
		out += 1
print(out)


(n, m) = [int(x) for x in input().split()]
heigths = [int(x) for x in input().split()]
counter = 0
for i in range(n):
	if heigths[i] > m:
		counter += 2
	else:
		counter += 1
print(counter)


import sys
first = 0
num = 0
height = 0
counter = 0
for line in sys.stdin:
	if first == 0:
		first = 1
		x = line.split()
		num = int(x[0])
		height = int(x[1])
	else:
		y = line.split()
		for i in y:
			if int(i) <= height:
				counter += 1
			else:
				counter += 2
print(counter)


(a, b) = map(int, input().strip().split())
x = list(map(int, input().strip().split()))
c = 0
for i in x:
	if i > b:
		c += 2
	else:
		c += 1
print(c)


(n, h) = input().split()
n = int(n)
h = int(h)
l = [int(x) for x in input().split()]
s = sum([l[i] > h for i in range(len(l))] * 1)
print(len(l) + s)


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


in1 = input()
(n, h) = (int(x) for x in in1.split())
in2 = input()
ls = [int(x) for x in in2.split()]
width = 0
for x in ls:
	if x > h:
		width += 2
	else:
		width += 1
print(width)


(n, h) = input().split()
n = int(n)
h = int(h)
strinput = input()
f = []
for x in strinput.split():
	f.append(int(x))
t = 0
for x in f:
	if x > h:
		t += 2
	else:
		t += 1
print(t)


(N, H) = map(int, input().split())
fri = list(map(int, input().split()))
wid = N
for i in fri:
	if i > H:
		wid += 1
print(wid)


(n, h) = map(int, input().split())
wid = 0
a = input()
num = a.split()
num_list = list(map(int, num))
for i in range(n):
	if num_list[i] <= h:
		wid = wid + 1
	else:
		wid = wid + 2
print(wid)


z = input().split()
a = int(z[0])
b = int(z[1])
x = []
z1 = input().split()
for i in range(a):
	c = int(z1[i])
	if c % b == 0:
		x.append(int(c / b))
	else:
		x.append(int(c / b) + 1)
print(sum(x))


i = input
(n, h) = map(int, i().split())
print(n + len([f for f in map(int, i().split()) if f > h]))


(x, y) = input().split()
x = int(x)
y = int(y)
z = input().split()
for i in range(len(z)):
	z[i] = int(z[i])
Sum = 0
for i in z:
	if i <= y:
		Sum += 1
	else:
		Sum += 2
print(Sum)


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


(n, h) = map(int, input().split())
a = [int(x) for x in input().split()]
ans = n
for i in range(n):
	ans += a[i] > h
print(ans)


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


def giveint(x, b):
	if x > b:
		return 2
	else:
		return 1
(a, b) = map(int, input().split())
y = list(map(int, input().split()))
y = [giveint(x, b) for x in y]
print(sum(y))


(n, h) = map(int, input().split(' '))
s = 0
value = [int(i) for i in input().split(' ')]
for i in value:
	if i > h:
		s += 2
	else:
		s += 1
print(s)


a = list(map(int, input().split(' ')))
b = list(map(int, input().split(' ')))
sum = 0
for k in range(a[0]):
	if b[k] - a[1] > 0:
		sum += 2
	else:
		sum += 1
print(sum)


(n, h) = [int(i) for i in input().split()]
x = list(map(int, input().split()))
c = 0
for i in x:
	if i > h:
		c = c + 1
print(2 * c + n - c)


l = list(map(int, input().split()))
m = list(map(int, input().split()))
(c, d) = (0, 0)
for i in m:
	if i > l[1]:
		c += 1
	else:
		d += 1
print(c * 2 + d)


(number, height) = map(int, input().split())
friends = map(int, input().split())
width = 0
for friend in friends:
	if friend > height:
		width += 2
	else:
		width += 1
print(width)


(k, h) = map(int, input().split(' '))
weights = list(map(int, input().split(' ')))
counter = 0
for i in range(k):
	if weights[i] > h:
		counter += 2
	else:
		counter += 1
print(counter)


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


import os, io
from sys import stdout
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def binomial_coefficient(n, k):
	if 0 <= k <= n:
		ntok = 1
		ktok = 1
		for t in range(1, min(k, n - k) + 1):
			ntok *= n
			ktok *= t
			n -= 1
		return ntok // ktok
	else:
		return 0
(n, h) = list(map(int, input().split()))
l = list(map(int, input().split()))
print(sum(list(map(lambda x: 2 if x > h else 1, l))))


(n, h) = map(int, input().split())
l = [int(x) for x in input().split()]
ans = 0
for e in l:
	if e <= h:
		ans += 1
	else:
		ans += 2
print(ans)


(n, m) = map(int, input().split())
s = 0
for i in map(int, input().split()):
	s = [s + 1, s + 2][i > m]
print(s)


(n, h) = map(int, input().split())
heights = [int(i) for i in input().split()]
s = sum((1 if i <= h else 2 for i in heights))
print(s)


import sys
(n, h) = [int(x) for x in input().split()]
heights = [int(x) for x in input().split()]
sum = 0
for i in range(n):
	if heights[i] > h:
		sum += 2
	else:
		sum += 1
print(sum)


x = input('')
(n, h) = x.split()
y = input('')
ls = y.split()
ans = 0
for i in range(len(ls)):
	el = int(ls[i])
	if el > int(h):
		ans += 2
	else:
		ans += 1
print(ans)


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


(n, h) = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
cnt = len([aa for aa in a if aa > h]) + n
print(cnt)


(n, h) = input().split(' ')
n = int(n)
h = int(h)
w = 0
i = input().split(' ')
for k in i:
	k = int(k)
	if k <= h:
		w += 1
	elif k > h:
		w += 2
print(w)


x = input().split()
count = 0
a = int(x[0])
b = int(x[1])
y = input().split()
k = 0
for j in range(len(y)):
	k = int(y[j])
	if k > b:
		k = k / 2
		count += 2
	else:
		count += 1
print(count)


from sys import stdin, stdout
(n, h) = stdin.readline().split()
width = []
h_arr = list(stdin.readline().split())
for i in h_arr:
	if int(i) > int(h):
		width.append(2)
	else:
		width.append(1)
road_width = 0
for i in width:
	road_width += i
print(road_width)


n3 = input()
(n1, n2) = n3.split(' ')
roadWidth = 0
temp = input()
temp = temp.split(' ')
for i in range(0, len(temp)):
	if int(temp[i]) > int(n2):
		roadWidth += 1
	roadWidth += 1
print(roadWidth)


n = input().split()
h = int(n[1])
n = int(n[0])
ar = input().split()
count = 0
for a in ar:
	if int(a) > h:
		count += 1
print(n + count)


import sys

def valla():
	datos = list(map(int, sys.stdin.readline().strip().split()))
	valores = list(map(int, sys.stdin.readline().strip().split()))
	count = 0
	for i in valores:
		if i <= datos[1]:
			count += 1
		else:
			count += 2
	print(count)
valla()


import math
(n, m) = input().split()
n = int(n)
m = int(m)
k = 0
a = input().split()
for i in range(len(a)):
	if int(a[i]) > m:
		k = k + 2
	else:
		k = k + 1
print(k)


friendsAndFence = input().split(' ')
fence = int(friendsAndFence[1])
friends = input().split(' ')
width = 0
for var in friends:
	if int(var) > fence:
		width += 2
	else:
		width += 1
print(width)


nH = input().split()
arr = input().split()
w = 0
for i in arr:
	if int(i) > int(nH[1]):
		w += 2
	else:
		w += 1
print(w)


(w, h) = input().split(' ')
(w, h) = (int(w), int(h))
friends = list(map(int, input().split(' ')))
for friend in friends:
	if friend > h:
		w += 1
print(w)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
i = 0
while i < n and h >= l[i]:
	i += 1
print(2 * n - i)


(num, k) = map(int, input().split())
c = 1
a = list(map(int, input().split()))
for i in a:
	if i > k:
		c = c + 2
	else:
		c = c + 1
print(c - 1)


(n, h) = [int(a) for a in input().split()]
heights = [int(a) for a in input().split()]
count = 0
for height in heights:
	if height > h:
		count += 2
	else:
		count += 1
print(count)


mylist = []
x = input().split()
for i in range(2):
	mylist.append(int(x[i]))
a = mylist[0]
b = mylist[1]
l = []
x = input().split()
for i in range(a):
	l.append(int(x[i]))
c = 0
for i in l:
	if i > b:
		c += 2
	else:
		c += 1
print(c)


(n, h) = input().split()
tall = input().split()
count = 0
for i in tall:
	if int(i) <= int(h):
		count += 1
	else:
		count += 2
print(count)


(n, k) = map(int, input().split())
a = [int(i) for i in input().split()]
c = 0
for i in a:
	if i <= k:
		c += 1
	else:
		c += 2
print(c)


(a, b) = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
for i in range(a):
	if c[i] > b:
		ans += 1
print(a + ans)


inputs = input().split(' ')
(n, h) = (int(inputs[0]), int(inputs[1]))
inputs = input().split(' ')
friends = [int(inputs[i]) for i in range(len(inputs))]
min_width = 0
for friend in friends:
	if friend > h:
		min_width += 2
	else:
		min_width += 1
print(min_width)


line = input().split()
n = int(line[0])
h = int(line[1])
width = 0
line = [int(i) for i in input().split()]
for j in line:
	if j > h:
		width += 2
	else:
		width += 1
print(str(width))


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
print(list(map(lambda x: x > h, l)).count(True) + len(l))


(n, k) = map(int, input().split())
friends = [int(x) for x in input().split()]
res = 0
for friend in friends:
	if friend <= k:
		res += 1
	else:
		res += 2
print(res)


first = input().split()
first = [int(i) for i in first]
num = first[0]
fence = first[-1]
heights = input().split()
heights = [int(i) for i in heights]
road = 0
for i in heights:
	if i > fence:
		road += 2
	else:
		road += 1
print(road)


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


(*i,) = map(int, input().split())
(*l,) = map(int, input().split())
print(i[0] + sum(((0, 1)[l[j] > i[1]] for j in range(i[0]))))


(a, b) = list(map(int, input().split()))
l = list(map(int, input().split()))
l1 = []
for i in l:
	if i <= b:
		l1.append(1)
	else:
		l1.append(2)
print(sum(l1))


(y, z) = input().split()
x = input().split()
c = 0
for i in x:
	if int(i) > int(z):
		c = c + 2
	else:
		c += 1
print(c)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
w = 0
if len(a) > n:
	raise ValueError
for i in range(len(a)):
	if a[i] <= h:
		w += 1
	else:
		w += 2
print(w)


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
road = []
for i in a:
	if i > k:
		road.append(2)
	else:
		road.append(1)
width = sum(road)
print(width)


(n, h) = input().split()
(n, h) = (int(n), int(h))
liste = input().split()
min_width = 0
for elem in liste:
	if int(elem) > h:
		min_width += 2
	else:
		min_width += 1
print(min_width)


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


from typing import List

def get_line_as_int_list() -> List[int]:
	return list(map(int, input().split(' ')))

def main() -> None:
	(_, max_hight) = get_line_as_int_list()
	row = get_line_as_int_list()
	filtered_lst = list(map(lambda x: 1 if x <= max_hight else 2, row))
	print(sum(filtered_lst))
main()


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


inputs1 = input()
inputs2 = input()
h = int(inputs1.split(' ')[1])
total = inputs2.split(' ')
width = 0
for w in total:
	w = int(w)
	if w <= h:
		width = width + 1
	elif h < w <= 2 * h:
		width = width + 2
print(width)


def main():
	(n, h) = map(int, input().split())
	a = [int(x) for x in input().split()]
	o = 0
	for i in range(n):
		if a[i] > h:
			o += 1
	print(o + n)
main()


x = list(map(int, input().split()))
L = list(map(int, input().split()))
count = 0
for i in range(len(L)):
	if L[i] > x[1]:
		count += 2
	else:
		count += 1
print(count)


(n, h) = map(int, input().split())
arr = list(map(int, input().split()))
bend = sum((i > h for i in arr))
print(bend * 2 + n - bend)


s = input().split(' ')
(n, h) = (int(s[0]), int(s[1]))
l = [int(k) for k in input().split(' ')]
res = 0
for i in l:
	if i > h:
		res += 2
	else:
		res += 1
print(res)


(n, m) = map(int, input().split(' '))
c = 0
l = list(map(int, input().split(' ')))
for i in range(len(l)):
	if l[i] <= m:
		c = c + 1
	else:
		c = c + 2
print(c)


(n, h) = [int(n) for n in input().split()]
text = input().split()
li = [int(i) for i in text]
count = 0
for i in li:
	if i > h:
		count += 2
	elif i <= h:
		count += 1
print(count)


(m, n) = map(int, input().split())
arr = list(map(int, input().split()))
c = 0
for item in arr:
	if item > n:
		c += 2
	else:
		c += 1
print(c)


n_h = input()
lof = input()
n_h2 = n_h.split(' ')
lof2 = lof.split(' ')
heightOfFence = int(n_h2[1])
width = 0
for i in lof2:
	if int(i) > heightOfFence:
		width = width + 2
	else:
		width = width + 1
print(width)


(n, h) = [int(n) for n in input().split()]
arr = [int(x) for x in input().split()]
w = 0
for i in arr:
	if i > h:
		w += 2
	else:
		w = w + 1
print(w)


(n, h) = [int(x) for x in input().split()]
sequence = input().split()
result = 0
for x in sequence:
	if int(x) > h:
		result += 2
	else:
		result += 1
print(result)


(n, h) = input().split()
hf = input().split()
width = 0
for i in hf:
	if int(i) > int(h):
		width += 2
	else:
		width += 1
print(width)


try:
	(n, h) = map(int, input().split())
	arr = [int(x) for x in input().split()]
	c = 0
	for i in arr:
		if i <= h:
			c += 1
		else:
			c += 2
	print(c)
except:
	pass


def min_valid_width(nFriends, fence, heights):
	width = 0
	for h in heights:
		if h > fence:
			width += 2
		else:
			width += 1
	return width
(nFriends, fence) = [int(i) for i in input().split()]
heights = [int(i) for i in input().split()]
print(min_valid_width(nFriends, fence, heights))


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


(t, h) = map(int, input().split())
list = [int(i) for i in input().split()]
output = 0
for i in range(t):
	if list[i] > h:
		output += 1
print(t + output)


(n, h) = map(int, input().split())
t = list(map(int, input().split()))
w = n
for i in t[0:]:
	if i > h:
		w += 1
print(w)


w = 0
(n, h) = input().split()
array = input().split()
for i in range(0, int(n), 1):
	if int(array[i]) <= int(h):
		w = w + 1
	else:
		w = w + 2
print(w)


(n, h) = [int(x) for x in input().split()]
a = [1 + (int(x) > h) for x in input().split()]
print(sum(a))


import math
(n, h) = map(int, input().split())
s = input()
l = list(s.split(' '))
count = 0
for i in l:
	if int(i) <= h:
		count = count + 1
	else:
		x = math.ceil(int(i) / h)
		count = count + x
print(count)


(n, h) = input().split(' ')
(n, h) = (int(n), int(h))
fh = [int(i) for i in input().split(' ')]
w = [1] * n
for i in range(n):
	if fh[i] > h:
		w[i] += 1
print(sum(w))


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


(n, h) = map(int, input().split())
a = [int(x) for x in input().split()]
count = 0
for e in a:
	if e > h:
		count += 1
print(count * 2 + (len(a) - count))


(n, m) = map(int, input().split())
s = map(int, input().split())
k = 0
s = list(s)
for i in range(n):
	if s[i] <= m:
		k += 1
	else:
		k += 2
print(k)


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


(n, h) = map(int, input().split())
width = n
lis = map(int, input().split())
lis = sorted(lis)
for i in reversed(range(n)):
	if lis[i] > h:
		width += 1
	else:
		break
print(width)


(n, h) = input().split(' ')
n = int(n)
h = int(h)
a = input().split(' ')
for i in range(len(a)):
	a[i] = int(a[i])
ans = 0
for i in a:
	if i > h:
		ans += 1
	ans += 1
print(ans)


line1 = input().split(' ')
a = input().split(' ')
n = int(line1[0])
h = int(line1[1])
width = 0
for i in range(n):
	if int(a[i]) > h:
		width += 2
	else:
		width += 1
print(width)


(friends, fenceHeight) = map(int, input().split(' '))
roadWidth = 0
friendHeights = list(map(int, input().split(' ')))
for height in friendHeights:
	if height > fenceHeight:
		roadWidth += 2
	else:
		roadWidth += 1
print(roadWidth)


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


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
m = len(a)
c = []
z = 0
for i in range(m):
	if a[i] <= h:
		c.append(1)
	else:
		c.append(2)
print(sum(c))


inp = input
li = list
iinp = lambda : int(inp())
ent = lambda : map(int, inp().split())
lient = lambda : [int(i) for i in inp().split()]
li0 = lambda x: [0 for i in range(x)]
(n, h) = ent()
alturas = lient()
res = 0
for i in alturas:
	if i > h:
		res += 2
	else:
		res += 1
print(res)


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


inp = input()
sizes = input()
count = 0
inp = inp.split()
h = int(inp[1])
sizes = sizes.split()
for i in sizes:
	if int(i) > h:
		count += 2
	else:
		count += 1
print(count)


n = list(map(int, input().split(' ')))
h = list(map(int, input().split(' ')))
w = 0
for f in h:
	if f > n[-1]:
		w += 2
	else:
		w += 1
print(w)


(a, b) = map(int, input().split())
s = [int(x) for x in input().split()]
c = 0
for i in range(a):
	if s[i] <= b:
		c += 1
	if s[i] > b:
		c += 2
print(c)


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


count = 0
(a, b) = map(int, input().split())
for num in map(int, input().split()):
	if num > b:
		count += 2
	else:
		count += 1
print(count)


(no, h) = map(int, input().split())
count = 0
cases = list(map(int, input().split()))
for person in cases:
	if person <= h:
		count += 1
	else:
		count += 2
print(count)


n_h = input()
(n, h) = n_h.split(sep=' ')
h = float(h)
heights = input()
heights_list = heights.split(sep=' ')
total_width = 0
for ph in heights_list:
	ph = float(ph)
	if ph <= h:
		total_width = total_width + 1
	else:
		total_width = total_width + 2
print(total_width)


def compute_width(heights, h):
	width = 0
	for ai in heights:
		if ai > h:
			width += 2
		else:
			width += 1
	return width
read = input().split(' ')
n = int(read[0])
h = int(read[1])
heights = [int(i) for i in input().split(' ')]
print(compute_width(heights, h))


(n, h) = input().split(' ')
n = int(n)
h = int(h)
list = input().split(' ')
len = 0
for x in list:
	x = int(x)
	if x > h:
		len += 2
	if x <= h:
		len += 1
print(len)


import sys

def main():
	t = sys.stdin.readline().split()
	n = int(t[0])
	h = int(t[1])
	line = sys.stdin.readline()
	x = list(map(int, line.split()))
	res = 0
	for i in range(n):
		if x[i] > h:
			res += 1
		res += 1
	print(res)
main()


h = input().split()
h = int(h[1])
arr = input().split()
res = 0
for i in arr:
	if int(i) > h:
		res += 2
	else:
		res += 1
print(res)


def f():
	return map(int, input().split())
(n, h) = f()
print(n + sum((q > h for q in f())))


n = list(map(int, input().split()))
z = int(n[0])
x = int(n[1])
l = list(map(int, input().split()))
t = 0
for i in range(z):
	if l[i] <= x:
		t += 1
	if l[i] > x:
		t += 2
print(t)


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


(n, h) = map(int, input().split())
a = map(int, input().split())
ans = sum(map(lambda x: 2 if x > h else 1, a))
print(ans)


(n, h) = map(int, input().split())
array = list(map(int, input().split()))
con = len(array)
for i in array:
	if i > h:
		con += 1
print(con)


import sys
(n, h) = map(int, sys.stdin.readline().split())
a = sys.stdin.readline().split()
res = 0
for i in a:
	if int(i) > h:
		res += 2
	else:
		res += 1
print(res)


nh = input().split(' ')
a_str = input().split(' ')
(n, h) = (int(nh[0]), int(nh[1]))
a_int = [int(x) for x in a_str]
for height in a_int:
	if height > h:
		n += 1
print(n)


a = input()
b = input()
a = a.split(' ')
b = b.split(' ')
mayor = 0
for i in range(0, int(a[0])):
	if int(b[i]) <= int(a[1]):
		mayor += 1
	if int(b[i]) > int(a[1]):
		mayor += 2
print(mayor)


L1 = input()
L2 = input()
Linea1 = L1.split()
Linea2 = L2.split()
N = int(Linea1[0])
H = int(Linea1[1])
Contador = 0
for k in range(N):
	if int(Linea2[k]) > H:
		Contador += 2
	else:
		Contador += 1
print(Contador)


(n, h) = map(int, input().split())
friends = list(map(int, input().split()))
width = 0
for f in friends:
	if f <= h:
		width += 1
	else:
		width += 2
print(width)


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


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
y = list(map(lambda x: 2 if x > h else 1, a))
print(sum(y))


(x, z) = map(int, input().split())
l = list(map(int, input().split()))
s = 0
e = 0
while s < x:
	if l[s] <= z:
		e += 1
	else:
		e += 2
	s += 1
print(e)


(n, k) = map(int, input().split())
a = [int(x) for x in input().split()]
c = 0
for i in a:
	if i > k:
		c += 1
print(n + c)


inp = input()
n = int(inp.split(' ')[0])
h = int(inp.split(' ')[1])
ans = 0
inp = input()
for a in inp.split(' '):
	k = int(a)
	if k > h:
		ans += 2
	else:
		ans += 1
print(ans)


x = input()
y = x.split()
z = [int(d) for d in y]
a = input()
b = a.split()
c = [int(d) for d in b]
count = 0
for i in c:
	if i > z[1]:
		count += 2
	else:
		count += 1
print(count)


import math
import os
import random
import re
import sys
(n, h) = map(int, input().rstrip().split())
l = list(map(int, input().rstrip().split()))
c = 0
for x in l:
	if x > h:
		c = c + 2
	else:
		c = c + 1
print(c)


(N, H) = map(int, input().split())
A = list(map(int, input().split()))
ans = sum([1 if x <= H else 2 for x in A])
print(ans)


a = list(map(int, input().split()))
b = list(map(int, input().split()))
i = 0
count = 0
while i < len(b):
	if b[i] <= a[1]:
		count += 1
		i += 1
	else:
		count += 2
		i += 1
print(count)


a = [int(i) for i in input().split(' ')]
n = a[0]
h = a[1]
b = []
c = 0
s = [int(i) for i in input().split(' ')]
for i in range(n):
	if s[i] > h:
		c += 1
print(n + c)


def main():
	(friends, height) = map(int, input().split())
	heights = list(map(int, input().split()))
	if 1 <= friends <= 1000 and 1 <= height <= 1000:
		length = 0
		for i in range(len(heights)):
			if heights[i] > height:
				length += 2
			else:
				length += 1
		print(length)
main()


(n, h) = input().split(' ')
guys = input().split(' ')
sum = 0
for i in guys:
	if int(i) > int(h):
		sum += 2
	else:
		sum += 1
print(sum)


(x, y) = input().split()
x = int(x)
y = int(y)
s = input().split(' ')
s = [int(i) for i in s]
sum = 0
for i in s:
	if i > y:
		sum += 2
	else:
		sum += 1
print(sum)


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


n = input().split()
h = input().split()
hl = []
t = 0
for i in range(int(n[0])):
	hl.append(int(h[i]))
for i in range(int(n[0])):
	if hl[i] <= int(n[1]):
		t += 1
	elif hl[i] % int(n[1]) == 0:
		t += hl[i] // int(n[1])
	else:
		t += hl[i] // int(n[1]) + 1
print(t)


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


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


def invr():
	return map(int, input().split())
firstInput = list(invr())
secondInput = list(invr())
n = firstInput[0]
h = firstInput[1]
friends = 0

def test():
	global friends
	for i in range(n):
		friends += 1
	global width
	width = friends
	for i in secondInput:
		if i > h:
			i /= 2
			width += 1
test()
print(width)


line = input().split()
n = int(line[0])
h = int(line[1])
arr = list(map(int, input().rstrip().split()))
width = 0
for ai in arr:
	if ai > h:
		width += 2
	else:
		width += 1
print(width)


(n, h) = map(int, input().split())
counter = 0
a = map(int, input().split())
for j in a:
	if j <= h:
		counter += 1
	else:
		counter += 2
print(counter)


a = list(map(int, input().split(' ')))
b = list(map(int, input().split(' ')))
n = a[0]
h = a[1]
m = n
for i in b:
	if i > h:
		m = m + 1
print(m)


x = input().split()
y = input().split()
n = int(x[0])
h = int(x[1])
z = 0
for i in y:
	if int(i) <= h:
		z += 1
	else:
		z += 2
print(z)


def solve(n, h, s):
	count = 0
	for i in s:
		if i > h:
			count += 1
	return count * 2 + (n - count)
(n, h) = tuple(map(int, input().split()))
s = list(map(int, input().split()))
print(solve(n, h, s))


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


u = input()
ue = u.split(' ')
h = float(ue[1])
w = input()
we = w.split(' ')
ab = []
width = 0
for element1 in we:
	ab = ab + [int(element1)]
for element2 in ab:
	if element2 > h:
		width += 2
	else:
		width += 1
print(width)


from math import ceil
(_, h) = map(int, input().split())
a = map(int, input().split())
width = 0
for ai in a:
	width += ceil(ai / h)
print(width)


from sys import stdin, stdout, stderr
import math

def main():
	(n, h) = map(int, stdin.readline().split())
	a = list(map(int, stdin.readline().split()))
	ans = n
	for x in a:
		ans += x > h
	stdout.write(str(ans))
main()


(m, n) = map(int, input().split())
li = list(map(int, input().split()))
count = 0
for i in li:
	if i > n:
		count += 2
	else:
		count += 1
print(count)


user_input = input().split()
the_friends = int(user_input[0])
the_fence_height = int(user_input[1])
the_friends_height = input().split()
width_count = 0
for x in the_friends_height:
	if int(x) > the_fence_height:
		width_count += 2
	else:
		width_count += 1
print(width_count)


(m, n) = map(int, input().split())
ar = list(map(int, input().split()))
count = 0
count1 = 0
for i in range(m):
	if ar[i] <= n:
		count = count + 1
	else:
		count1 = count1 + 2
count = count + count1
print(count)


def ll():
	return list(map(int, input().split()))
first_l = []
second_l = []
c = 0
for i in range(1):
	s = ll()
	first_l = first_l + s
for j in range(1):
	t = ll()
	second_l = second_l + t
for z in range(len(second_l)):
	if second_l[z] <= s[1]:
		c += 1
	else:
		c += 2
print(c)


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


(n, h) = map(int, input().split())
L = [int(y) for y in input().split()]
for i in L:
	n += [0, 1][i > h]
print(n)


(n, h) = input('').split()
n = int(n)
h = int(h)
counter = 0
hh = input('').split()
for i in range(0, n):
	x1 = int(hh[i])
	if x1 > h:
		counter += 1
print(n - counter + counter * 2)


def fence(n, h, a):
	c = 0
	for i in range(0, n):
		if a[i] <= h:
			c += 1
		if a[i] > h:
			c += 2
	return c
(n, h) = map(int, input().split())
a = list(map(int, input().rstrip().split()))
res = fence(n, h, a)
print(res)


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


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


def findIt(a, x):
	if a[-1] <= x:
		return len(a)
	(lo, hi) = (0, len(a) - 1)
	while lo < hi:
		m = lo + (hi - lo) // 2
		if a[m] <= x:
			lo = m + 1
		else:
			hi = m
	return hi
(n, k) = map(int, input().split())
a = sorted(list(map(int, input().split())))
p = findIt(a, k)
print(p * 1 + max(0, n - p) * 2)


(a, b) = map(int, input().split())
c = [int(x) for x in input().split()]
s = a
for i in c:
	if i > b:
		s += 1
print(s)


data = input()
data = data.split()
kids = int(data[0])
height = int(data[1])
data = input()
data = data.split()
width = 0
for i in data:
	if int(i) <= height:
		width += 1
	else:
		width += 2
print(width)


(n, h) = map(int, input().split())
rost = [int(i) for i in input().split()]
num = 0
for j in rost:
	if j > h:
		num += 2
	else:
		num += 1
print(num)


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


xyz = []

def input1():
	global xyz
	if len(xyz) == 0:
		xyz = [int(i) for i in input().split()]
		xyz = xyz[::-1]
	v = xyz[-1]
	del xyz[-1]
	return v
n = input1()
h = input1()
x = []
for i in range(n):
	x.append(input1())
ans = 0
for z in range(len(x)):
	if x[z] > h:
		ans = ans + 2
	else:
		ans = ans + 1
print(ans)


(n, h) = map(int, input().split())
a = map(int, input().split())
width = 0
width = n + sum([1 for x in a if x > h])
print(width)


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


(a, b) = input('').split(' ')
n = int(a)
h = int(b)
output = 0
for c in input('').split(' '):
	g = int(c)
	if g > h:
		output = output + 2
	else:
		output = output + 1
print(output)


def res(i, h):
	if i > h:
		return 2
	else:
		return 1
(n, h) = map(int, input().split())
list_1 = [int(i) for i in input().split()]
print(sum([res(i, h) for i in list_1]))


(friends, height) = [int(i) for i in input().split()]
l = input().split()
c = 0
for i in l:
	if int(i) > height:
		c += 2
	else:
		c += 1
print(c)


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


list1 = input().split(' ')
list_num = [int(i) for i in list1]
n = list_num[0]
h = list_num[1]
list2 = input().split(' ')
list_num_2 = [int(i) for i in list2]
count = 0
for i in list_num_2:
	if i > h:
		count += 2
	else:
		count += 1
print(count)


(n, h) = map(int, input().split())
list_of_people = []
count = 0
list_of_people = [int(x) for x in input().split()]
for y in list_of_people:
	if y <= h:
		count += 1
	else:
		count += 2
print(count)


(n, h) = [int(x) for x in input().split()]
L = [int(x) for x in input().split()]
som = 0
for k in L:
	if k > h:
		som += 2
	else:
		som += 1
print(som)


string = input().split(' ')
n = int(string[0])
h = int(string[1])
friendHeight = input().split(' ')
bent = 0
for friend in friendHeight:
	if int(friend) > h:
		bent += 1
print(str(bent + n))


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


(n, m) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
c = 0
for i in a:
	if i > m:
		c += 2
	else:
		c += 1
print(c)


(n, h) = map(int, input().split())
rd = list(map(int, input().split()))
sh = 0
if 1 <= n <= 1000 and 1 <= h <= 1000 and (len(rd) == n):
	for i in range(len(rd)):
		if rd[i] <= h:
			sh += 1
		else:
			sh += 2
print(sh)


(n, h) = map(int, input().split(' '))
arr = [int(i) for i in input().split(' ')]
res = 0
for i in arr:
	if i > h:
		res += 1
print(res + n)


(n, x) = map(int, input().split())
s = list(map(int, input().split()))
Cnt = 0
for i in s:
	if i > x:
		Cnt += 2
	else:
		Cnt += 1
print(Cnt)


(a, b) = input().split()
b = int(b)
s = []
l = list(map(int, input().split()))
for i in range(len(l)):
	if l[i] <= b:
		s.append(1)
	else:
		s.append(2)
print(sum(s))


(n, h) = (int(x) for x in input().split(' '))
a = [int(x) for x in input().split(' ')]
minw = 0
for elem in a:
	if elem > h:
		minw += 2
	else:
		minw += 1
print(minw)


(n, h) = input().split(' ')
n = int(n)
h = int(h)
a = [int(x) for x in input().strip().split(' ')]
count = 0
for i in a:
	if i <= h:
		count += 1
	else:
		count += 2
print(count)


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


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


def solve(data, h, n):
	cnt = 0
	for i in range(n):
		if data[i] > h:
			cnt += 2
		else:
			cnt += 1
	return cnt
(n, h) = [int(x) for x in input().split()]
data = [int(x) for x in input().split()]
print(solve(data, h, n))


def road(n, lis):
	width = 0
	for ele in lis:
		if ele <= n:
			width += 1
		else:
			width += 2
	print(width)
test = list(map(int, input().split()))
lis = list(map(int, input().split()))
road(test[1], lis)


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


(m, n) = map(int, input().split(' '))
people = input().split()
a = 0
for i in people:
	if int(i) > n:
		a = a + 2
	else:
		a = a + 1
print(a)


(n, h) = [int(i) for i in input().split()]
heights = [int(h) for h in input().split()]
count = 0
for c in heights:
	if c <= h:
		count += 1
	else:
		count += 2
print(count)


(friends, fence_height) = [int(x) for x in input().split()]
people = [int(x) for x in input().split()]
road_width = 0
for person_height in people:
	if person_height > fence_height:
		road_width += 2
	elif person_height <= fence_height:
		road_width += 1
print(road_width)


(a, b) = [int(x) for x in input().split()]
q = [int(x) for x in input().split()]
c = 0
for i in range(0, a):
	if q[i] <= b:
		c = c + 1
	if q[i] > b:
		c = c + 2
print(c)


import sys
[n, h] = list(map(int, input().split()))
heights = list(map(int, input().split()))
w = 0
for i in heights:
	if i <= h:
		w += 1
	else:
		w += 2
print(w)


(nh, ai, k) = ([int(s) for s in input().split()], [int(s) for s in input().split()], 0)
for i in range(nh[0]):
	if ai[i] > nh[1]:
		k += 2
	else:
		k += 1
print(k)


import sys
(n, h) = map(int, sys.stdin.readline().split())
alist = list(map(int, sys.stdin.readline().split()))
print(n + len([a for a in alist if a > h]))


(n, k) = map(int, input().split())
ara = list(map(int, input().split()))
ans = 0
for i in ara:
	if i <= k:
		ans += 1
	else:
		ans += 2
print(ans)


s = input()
n = int(s[:s.find(' ')])
h = int(s[s.find(' ') + 1:])
sum = 0
l = str.split(input())
for i in range(n):
	if int(l[i]) > h:
		sum = sum + 2
	else:
		sum = sum + 1
print(sum)


a = input().split()
n = int(a[0])
h = int(a[1])
b = input().split()
x = 0
w = 0
while x < len(b):
	b[x] = int(b[x])
	x = x + 1
x = 0
while x < len(b):
	if b[x] / h <= 1:
		w = w + 1
	else:
		w = w + 2
	x = x + 1
print(w)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
w = 0
for x in l:
	if x <= h:
		w += 1
	if x > h:
		w += 2
print(w)


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
c = n
for i in l:
	if i > k:
		c += 1
print(c)


def vf(h, lst):
	width = 0
	for i in range(len(lst)):
		lst[i] = int(lst[i])
		if lst[i] <= h:
			width += 1
		else:
			width += 2
	return width
(n, h) = input().split()
n = int(n)
h = int(h)
a = list()
a = input().split()
print(vf(h, a))


def wf(n, h, v):
	return n + len([x for x in v if x > h])
(n, h) = [int(x) for x in input().split()]
v = [int(x) for x in input().split()]
print(wf(n, h, v))


fl = input()
sl = input()
numberOfPeople = ''
fenceH = ''
flag = True
for i in fl:
	if i == ' ':
		flag = False
	elif flag:
		numberOfPeople += i
	else:
		fenceH += i
numberOfPeople = int(numberOfPeople)
fenceH = int(fenceH)
personH = ''
heights = []
for i in sl:
	if i == ' ':
		personH = int(personH)
		heights.append(personH)
		personH = ''
	else:
		personH += i
personH = int(personH)
heights.append(personH)
ans = 0
for i in heights:
	if i > fenceH:
		ans += 2
	else:
		ans += 1
print(ans)


input_s = input().split(' ')
input_l = input().split(' ')
mount = int(input_s[0])
h = int(input_s[1])
for l in input_l:
	if int(l) > h:
		mount += 1
print(mount)


(a, b) = list(map(int, input().split()))
heights = list(map(int, input().split()))
higher = 0
for i in heights:
	if i > b:
		higher += 1
print(a + higher)


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


(n, h) = list(map(int, input().split()))
f = []
f.extend(list(map(int, input().rstrip().split())))
count = 0
for i in range(n):
	if f[i] > h:
		count += 1
min_width = 2 * count + (n - count)
print(min_width)


a = input().split()
k = input().split()
cnt = 0
for i in k:
	if int(i) > int(a[1]):
		cnt += 2
	else:
		cnt += 1
print(cnt)


[n, h] = [int(i) for i in input().split(' ')]
l = input().split(' ')
br = 0
for j in range(len(l)):
	if int(l[j]) <= h:
		br = br + 1
	else:
		br = br + 2
print(br)


(f, h) = list(map(int, input().split()))
height = list(map(int, input().split()))
result = 0
for i in height:
	if i > h:
		result += 2
	else:
		result += 1
print(result)


(n, m) = map(int, input().split())
heights = list(map(int, input().split()))
width = 0
for h in heights:
	if h > m:
		width += 2
	else:
		width += 1
print(width)


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
res = 0
for i in a:
	if i > m:
		res += 2
	elif i <= m:
		res += 1
print(res)


(x, y) = map(int, input().split())
k = 0
num = list(map(int, input().split()))
for i in range(x):
	if num[i] > y:
		k += 2
	else:
		k += 1
print(k)


(num_of_friends, wall_height) = input().split()
num_of_friends = int(num_of_friends)
wall_height = int(wall_height)
heights = input().split()
heights = list(map(int, heights))
width = 0
for height in heights:
	if height > wall_height:
		width += 2
	else:
		width += 1
print(width)


line = input().split()
n = int(line[0])
h = int(line[1])
heights = input().split()
for hei in heights:
	if int(hei) > h:
		n += 1
print(n)


(x, y) = [int(x) for x in input().split()]
lst = list(map(int, input().split()))
res = 0
for i in lst:
	if i > y:
		res += 2
	else:
		res += 1
print(res)


import math
import os
import random
import re
import sys
from collections import Counter
from itertools import permutations
sys.setrecursionlimit(3000)

def si():
	return str(input())

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(mi())

def debug(x):
	return print(x)
(n, h) = mi()
a = li()
c = 0
for i in range(n):
	if a[i] > h:
		c += 1
print(n - c + c * 2)


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


line = input().split()
n = int(line[0])
h = int(line[1])
s = input()
data = [int(a) for a in s.split()]
i = 0
w = 0
while i < len(data):
	if data[i] <= h:
		w = w + 1
		i = i + 1
	else:
		w = w + 2
		i = i + 1
print(w)


(n, h) = map(int, input().split())
h_list = list(map(int, input().split()))
L = []
for ele in h_list:
	if ele > h:
		L.append(2)
	else:
		L.append(1)
print(sum(L))


(friends_num, fence_hight) = map(int, input().split())
friends_hight = list(map(int, input().split()))
waking_counter = 0
bending_counter = 0
for hight in friends_hight:
	if hight <= fence_hight:
		waking_counter += 1
	else:
		bending_counter += 2
print(waking_counter + bending_counter)


(n, h) = [int(i) for i in input().split()]
N = [int(i) for i in input().split()]
count = 0
for i in N:
	if i > h:
		count += 1
print(len(N) + count)


data1 = input()
lst1 = list()
lst2 = list()
for i in data1.split():
	lst1.append(int(i))
count1 = 0
count2 = 0
n = lst1[0]
h = lst1[1]
data2 = input()
for j in data2.split():
	lst2.append(int(j))
for k in lst2:
	if k > h:
		count2 = count2 + 1
	elif k <= h:
		count1 = count1 + 1
total = count2 * 2 + count1
print(total)


k = lambda : map(int, input().split())
(_, h) = k()
print(sum(([1, 2][x > h] for x in k())))


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


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


(n, n1) = map(int, input().split())
list1 = list(map(int, input().split()))
c = 0
for i in list1:
	if i <= n1:
		c = c + 1
	else:
		c = c + 2
print(c)


(n, h) = map(int, input().split())
a = map(int, input().split())
print(n + list(map(lambda ai: ai > h, a)).count(True))


nk = input().split()
k = int(nk[1])
li = list(map(int, input().strip().split()))
c = 0
for i in li:
	if i > k:
		c += 2
	else:
		c += 1
print(c)


inputs = input().split(' ')
s = 0
size = int(inputs[0])
h = int(inputs[1])
heights = input().split(' ')
for height in heights:
	if int(height) > h:
		s += 2
	else:
		s += 1
print(s)


nh = input().rstrip().split()
n = int(nh[0])
h = int(nh[1])
a = list(map(int, input().rstrip().split()))
s = 0
for i in range(0, len(a)):
	if a[i] > h:
		s += 2
	else:
		s += 1
print(s)


(W, E) = map(int, input().split())
l = list(map(int, input().split()))
count = 0
for i in l:
	if i > E:
		count += 2
	else:
		count += 1
print(count)


(n, h) = map(int, input().split())
L1 = map(int, input().split())
print(sum(([1, 2][i > h] for i in L1)))


c = 0
n_fence = list(map(int, input().split()))
frnd = list(map(int, input().split()))
for i in range(n_fence[0]):
	if frnd[i] <= n_fence[1]:
		c = c + 1
	else:
		c = c + 2
print(c)


height_of_every_student = []
result = 0
(number_of_friends, height_of_the_wall) = map(int, input().split())
height_of_every_student = list(map(int, input().split()))
for i in range(number_of_friends):
	if height_of_every_student[i] > height_of_the_wall:
		result += 2
	else:
		result += 1
print(result)


(m, k) = map(int, input().split())
count = 0
plus = 0
y = list(map(int, input().split()))
for i in range(m):
	if y[i] <= k:
		count += 1
	elif y[i] > k:
		plus += 2
result = count + plus
print(result)


var2 = [int(x) for x in input().split(' ')]
var1 = [int(x) for x in input().split(' ')]
result = var2[0]
for i in var1:
	if i > var2[1]:
		result += 1
print(result)


import sys
(n, h) = list(map(int, sys.stdin.readline().rstrip().split(' ')))
s = list(map(int, sys.stdin.readline().rstrip().split(' ')))
ss = 0
for i in s:
	if i > h:
		ss += 2
	else:
		ss += 1
print(ss)


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


numbers = [int(x) for x in input().split(' ')]
heights = [int(x) for x in input().split(' ')]
result = 0
for i in range(numbers[0]):
	if heights[i] <= numbers[1]:
		result += 1
	else:
		result += 2
print(result)


(n, h) = list(map(int, input().split()))
a = list(map(int, input().split()))
one = len(list(filter(lambda x: x <= h, a)))
two = len(a) - one
result = one + two * 2
print(result)


(friends, height) = input('').split()
friendsHeight = input('').split()
ans = 0
for friendH in friendsHeight:
	if int(friendH) <= int(height):
		ans += 1
	else:
		ans += 2
print(ans)


q = input().split(' ')
p = input().split(' ')
n = int(q[0])
h = int(q[1])
res = 0
for i in range(n):
	if int(p[i]) > h:
		res += 2
	else:
		res += 1
print(res)


(n, h) = input('').split()
path = input('')
List = path.split()
for i in range(len(List)):
	if int(List[i]) > int(h):
		List[i] = '2'
	else:
		List[i] = '1'
print(sum(list(map(int, List))))


(n, fence) = map(int, input().split())
width = 0
height = list(map(int, input().split()))
for i in height:
	if i <= fence:
		width += 1
	else:
		width += 2
print(width)


(m, h) = map(int, input().split())
c = 0
l = [int(x) for x in input().split()]
for i in l:
	if i > h:
		c = c + 2
	else:
		c = c + 1
print(c)


import sys
import os
data = list(map(int, input().split()))
n = data[0]
h = data[1]
a = list(map(int, input().split()))
cnt = 0
for i in range(0, len(a)):
	if a[i] > h:
		cnt = cnt + 2
	else:
		cnt = cnt + 1
print(cnt)


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


(num_of_freind, height_of_fence) = [int(x) for x in input().split(' ')]
height_of_friends = input().split()
height_of_friends = [int(x) for x in height_of_friends]
height_of_friends = sorted(height_of_friends)
width = 0
for x in height_of_friends:
	if x > height_of_fence:
		width += 2
	else:
		width += 1
print(width)


(n, m) = map(int, input().split())
num = list(map(int, input().split()))
sum = 0
for i in range(n):
	if num[i] <= m:
		sum = sum + 1
	else:
		sum = sum + 2
print(sum)


(n, m) = map(int, input().split())
s = input()
s = s.split()
a = 0
for i in range(n):
	a = a - -int(s[i]) // m
print(a)


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


height_of_fence = input().split()
height_of_children = input().split()
min_of_road = 0
for i in height_of_children:
	if int(i) <= int(height_of_fence[1]):
		min_of_road += 1
	else:
		min_of_road += 2
print(min_of_road)


(a, b) = map(int, input().split())
s = list(map(int, input().split()))
q = 0
for i in s:
	if i <= b:
		q += 1
	else:
		q += 2
print(q)


(a, b) = map(int, input().split())
arr = list(map(int, input().split()))
c = 0
for i in arr:
	if i > b:
		c += 2
	elif i <= b:
		c += 1
print(c)


(n, h) = input().split()
heights = [int(i) for i in input().split()]
c = 0
for i in heights:
	if i > int(h):
		c += 1
s = 2 * c + (int(n) - c)
print(s)


e = input().split(' ')
n = int(e[0])
h = int(e[-1])
a = list(map(int, input().split(' ')))
x = 0
r = 0
for i in range(n):
	if a[i] > h:
		x = 2
	else:
		x = 1
	r += x
print(r)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
nums = int(len(a))
for i in a:
	if i > h:
		nums += 1
print(nums)


(n, h) = map(int, input().split(' '))
heights = list(map(int, input().split(' ')))
widh = 0
for j in heights:
	if j > h:
		widh += 2
	else:
		widh += 1
print(widh)


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


(n, h) = input().split()
n = int(n)
h = int(h)
result = 0
temp = input().split(' ')
for i in temp:
	i = int(i)
	if i > h:
		result += 2
	else:
		result += 1
print(result)


(m, n) = map(int, input().split())
l = [int(x) for x in input().split()]
num = 0
for i in range(0, len(l)):
	if l[i] <= n:
		num += 1
	else:
		num += 2
print(num)


A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
n = A[0]
h = A[1]
num = 0
for i in B:
	if i > h:
		num += 1
print(n + num)


from sys import stdin
(people, fence) = map(int, stdin.readline().split())
A = list(map(int, stdin.readline().split()))
Width = 0
for i in A:
	if i <= fence:
		Width = Width + 1
	else:
		Width = Width + 2
print(Width)


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


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


(n, h) = input().split()
n = int(n)
h = int(h)
con = 0
pop = input().split()
pop = list(pop)
for i in range(len(pop)):
	pop[i] = int(pop[i])
for i in range(0, n):
	if pop[i] <= h:
		con += 1
	else:
		con += 2
print(con)


nh = input().split()
a = input().split()
w = 0
for i in range(int(nh[0])):
	if int(a[i]) > int(nh[1]):
		w += 2
	else:
		w += 1
print(w)


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


(z, y) = map(int, input().split())
m = 0
x = input('').split()
for c in range(z):
	if int(x[c]) <= y:
		m += 1
	if int(x[c]) > y:
		m += 2
print(m)


n = input().split()
n1 = int(n[0])
h = int(n[1])
ar = [int(x) for x in input().split()]
ans = 0
for i in ar:
	if i <= h:
		ans += 1
	else:
		ans += 2
print(ans)


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


n = [*map(int, input().split())]
m = [*map(int, input().split())]
print(sum([1 if _ <= n[1] else 2 for _ in m]))


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


nh = input().split()
n = int(nh[0])
h = int(nh[1])
heights = [int(x) for x in input().split()]
m = 0
for height in heights:
	if height > h:
		m += 2
	else:
		m += 1
print(m)


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


l1 = input().split()
l2 = input().split()
n = int(l1[0])
h = int(l1[1])
a = [int(x) for x in l2]
for x in a:
	if x > h:
		n += 1
print(n)


(n, h) = map(int, input().split())
orig = map(int, input().split())
res = {}
count = 0
for (i, item) in enumerate(orig):
	if item > h:
		res[i] = [2, item // 2]
	elif item <= h:
		res[i] = [1, item // 2]
for (k, val) in res.items():
	count += val[0]
print(count)


b = [i for i in range(0, 2)]
for i in range(0, 2):
	b[i] = list(map(int, input().split()))
w = 0
for i in range(0, b[0][0]):
	if b[1][i] > b[0][1]:
		w = w + 2
	if b[1][i] <= b[0][1]:
		w = w + 1
print(w)


(n, threshold) = input().split(' ')
people = [int(v) for v in input().split(' ')]
res = 0
for i in range(int(n)):
	p = people[i]
	if p > int(threshold):
		res += 2
	else:
		res += 1
print(res)


def min_poss():
	a = []
	[a.append(int(i)) for i in input().split(' ')]
	w_person = []
	[w_person.append(int(i)) for i in input().split(' ')]
	l = len(w_person)
	sum = 0
	for i in range(l):
		if w_person[i] <= a[1]:
			sum += 1
		else:
			sum += 2
	print(sum)
min_poss()


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


inputs = list(map(int, input().split()))
numbers = list(map(int, input().split()))
ans = 0
for x in numbers:
	if x > inputs[1]:
		ans += 2
	else:
		ans += 1
print(ans)


num1 = list(map(int, input().split()))
num2 = num1[1]
arr = list(map(int, input().split()))
sol = 0
for num in arr:
	if num <= num2:
		sol += 1
	else:
		sol += 2
print(sol)


(n, h) = map(int, input().split())
heights = input().split()
width = n
for num in heights:
	num = int(num)
	if num > h:
		width += 1
print(width)


a = input()
b = input()
sum = 0
l = int(a.split(' ')[0])
c = int(a.split(' ')[1])
b = b.split(' ')
for ga in range(l):
	b[ga] = int(b[ga])
for i in range(l):
	if b[i] <= c:
		sum += 1
	if b[i] > c:
		sum += 2
print(sum)


(n, h) = map(int, input().split())
heights = list(map(int, input().split()))
answer = 0
for height in heights:
	if height > h:
		answer += 2
	else:
		answer += 1
print(answer)


(n, k) = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
print(len(x) + sum((i > k for i in x)))


(n, h) = map(int, input().split())
lis = list(map(int, input().split()))
print(n + sum((i > h for i in lis)))


i = lambda : map(int, input().split())
(n, h) = i()
a = list(i())
print(sum((x <= h for x in a)) + 2 * sum((x > h for x in a)))


(n, k) = map(int, input().split())
lst = list(map(int, input().split()))
sm = 0
for i in lst:
	if i <= k:
		sm += 1
	else:
		sm += 2
print(sm)


(n, h) = input().split(' ')
a = (n, h)
a = list(a)
for i in range(len(a)):
	a[i] = int(a[i])
e = 0
l = list()
w = input()
l.extend(w.split())
for i in range(a[0]):
	l[i] = int(l[i])
for i in range(a[0]):
	if l[i] <= a[1]:
		e = e + 1
	else:
		e = e + 2
print(e)


(n, h) = map(int, input().rstrip().split())
nums = list(map(int, input().rstrip().split()))
result = 0
for num in nums:
	result += 2 if num > h else 1
print(result)


(n, h) = [int(x) for x in input().split(' ')]
a = [int(x) for x in input().split(' ')]
cnt = len(a)
for x in a:
	if x > h:
		cnt += 1
print(cnt)


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


def mCheckInputs(inputList):
	n = inputList[0]
	h = inputList[1]
	peopleList = inputList[2]
	if n.isdigit() and 1 <= int(n) <= pow(10, 3) and h.isdigit() and (1 <= int(h) <= 1000) and (len(peopleList) == int(n)):
		pass
	else:
		exit(1)

def mHandleInputs(inputList):
	try:
		(n, h) = input().split()
		peopleList = list(map(int, input().split()))
		inputList.extend([n, h, peopleList])
		mCheckInputs(inputList)
	except ValueError as e:
		exit(1)

def mDoWork(inputList, outputList):
	n = int(inputList[0])
	h = int(inputList[1])
	peopleList = inputList[2]
	result = sum((1 for item in peopleList if 1 <= item <= 2 * h and item > h))
	result += n
	outputList.append(result)

def mFormatResult(outputList):
	print(outputList[0])

def main():
	inputList = []
	mHandleInputs(inputList)
	outputList = []
	mDoWork(inputList, outputList)
	mFormatResult(outputList)
main()


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


nm = list(map(int, input().rstrip().split()))
m = nm[1]
line = list(map(int, input().rstrip().split()))
count = 0
for i in line:
	if i > m:
		count += 2
	else:
		count += 1
print(count)


try:
	(n, h) = map(int, input().split())
	b = input()
	friend = b.split()
	l = len(friend)
	count = 0
	for i in range(l):
		if int(friend[i]) > h:
			count += 2
		else:
			count += 1
	print(count)
except:
	pass


(m, h) = lst = list(map(int, input().split(' ')))
lst = list(map(int, input().split(' ')))
b = 0
for i in lst:
	if i > h:
		b = b + 2
	else:
		b = b + 1
print(b)


k = input()
(num, fence) = k.split(' ')
height = input()
height = height.split(' ')
width = 0
for x in height:
	if int(x) > int(fence):
		width += 2
	else:
		width += 1
print(width)


str1 = input('')
str2 = input('')
list1 = str1.split(' ')
list2 = str2.split(' ')
n = int(list1[0])
h = int(list1[1])
heights = [int(x) for x in list2]
width = 0
for height in heights:
	if height > h:
		width += 2
	else:
		width += 1
print(width)


(n, h) = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = sum((2 if i > h else 1 for i in a))
print(cnt)


(n, k) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
c = 0
for i in l:
	if i > k:
		c += 2
	else:
		c += 1
print(c)


args = input().split(' ')
n = int(args[0])
h = int(args[1])
args = input().split(' ')
width = n
for arg in args:
	if int(arg) > h:
		width += 1
print(width)


fri_fen = input().split(' ')
heights = input().split(' ')
a = []
width = 0
for i in heights:
	if int(i) > int(fri_fen[1]):
		a.append(2)
	else:
		a.append(1)
for i in a:
	width = width + i
print(width)


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


s = list(input().split(' '))
a = list(input().split(' '))
n = int(s[0])
h = int(s[1])
d = 0
for i in a:
	if int(i) > h:
		d = d + 2
	else:
		d = d + 1
print(d)


fenceHeight = int(input().split(' ')[1])
friendsHeightList = input().split(' ')
widthOfRoad = 0
for ele in friendsHeightList:
	if int(ele) <= fenceHeight:
		widthOfRoad += 1
	else:
		widthOfRoad += 2
print(widthOfRoad)


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


def minimum_road_width(friends_array, fence_height):
	min_road_width = 0
	for i in range(len(friends_array)):
		if friends_array[i] <= fence_height:
			min_road_width += 1
		else:
			min_road_width += 2
	return min_road_width
(number_of_friends, fence_height) = map(int, input().split())
friends_array = [int(x) for x in input().split()]
print(minimum_road_width(friends_array, fence_height))


import sys
v = []
cont = 0
(n, h) = input().split()
(n, h) = (int(n), int(h))
v = input()
a = v.split()
for i in range(n):
	if int(a[i]) <= h:
		cont += 1
	else:
		cont += 2
print(cont)


x = [int(i) for i in input().split()]
(n, h) = (x[0], x[1])
y = [int(i) for i in input().split()]
width = n
for i in y:
	if i > h:
		width += 1
print(width)


from sys import stdin, stdout
input = stdin.readline

def write(n, sep='\n'):
	stdout.write(str(n))
	stdout.write(sep)

def gil():
	return list(map(int, input().split()))
(n, h) = gil()
l = gil()
w = 0
for i in range(n):
	if l[i] <= h:
		w += 1
	else:
		w += 2
print(w)


(n, h) = (int(i) for i in input().split(' '))
heights = [int(i) for i in input().split(' ')]
cnt = 0
for i in heights:
	if i <= h:
		cnt += 1
	else:
		cnt += 2
print(cnt)


def findwidth(n, h):
	sum1 = 0
	i = 0
	while i < len(n):
		if n[i] > h:
			sum1 = sum1 + 2
		else:
			sum1 = sum1 + 1
		i = i + 1
	return sum1
t = input()
t = list(map(int, t.split(' ')))
li = input()
li = list(map(int, li.split(' ')))
print(findwidth(li, t[1]))


(L, n) = [int(s) for s in input().split()]
LIST = [int(s) for s in input().split()]
count = 0
for i in range(L):
	if LIST[i] <= n:
		count += 1
	else:
		a = LIST[i]
		c = 1
		while a > n:
			a = a / 2
			count += c * 2
print(count)


a = input()
fence = int(a.split()[1])
t = 0
for f in input().split():
	if int(f) <= fence:
		t += 1
	else:
		t += 2
print(t)


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


(n, h) = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
lower = list(filter(lambda x: x <= h, arr))
higher = list(filter(lambda x: x > h, arr))
print(len(lower) + 2 * len(higher))


(n, m) = map(int, input().split())
count = sum((i > m for i in map(int, input().split())))
print(n - count + count * 2)


s = list(map(int, input().split()))
r = list(map(int, input().split()))
count = 0
for i in r:
	if i > s[1]:
		count += 2
	else:
		count += 1
print(count)


(no_friends, h_wall) = input().split()
x = list(map(int, input().split()))
if len(x) != int(no_friends):
	exit('program interuptted ')
c = 0
for (n, i) in enumerate(x):
	if i > int(h_wall):
		c = c + 2
	else:
		c = c + 1
print(c)


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


s = input().split()
t = input().split()
p = 0
for i in range(0, int(s[0])):
	if int(t[i]) <= int(s[1]):
		p = p + 1
	if int(t[i]) > int(s[1]):
		p = p + 2
print(p)


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

def get_width(h_fence, heights):
	width = 0
	for friend in heights:
		if friend <= h_fence:
			width += 1
		else:
			width += 2
	return width
out = get_width(fence, a)
print(out)


(n, h) = input().split()
n = int(n)
h = int(h)
c = 0
lst = list(map(int, input().split()))[:n]
for i in range(len(lst)):
	if lst[i] <= h:
		c = c + 1
	else:
		c = c + 2
print(c)


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


(n, h) = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
count = 0
for x in lst:
	if x > h:
		count += 2
	else:
		count += 1
print(count)


(n, h) = [int(x) for x in input().split()]
H = [int(y) for y in input().split()]
width = 0
for d in H:
	if d > h:
		width += 2
	else:
		width += 1
print(width)


i = 0
z = 0
x = list(map(int, input().split()))
y = list(map(int, input().split()))
while i < x[0]:
	if y[i] <= x[1]:
		z += 1
	else:
		z += 2
	i += 1
print(z)


a = list((int(x) for x in input().split()))
b = list((int(x) for x in input().split()))
l = 0
for item in b:
	if item <= a[1]:
		l += 1
	else:
		l += 2
print(l)


def Main():
	(n, h) = map(int, input().split())
	arr = list(map(int, input().split()))
	jemi = 0
	for i in range(len(arr)):
		if arr[i] > h:
			jemi += 2
		else:
			jemi += 1
	print(jemi)
Main()


nh = list(map(int, input().strip().split()))
n = nh[0]
h = nh[1]
l = [int(i) for i in input().split()]
res = []
for i in l:
	if i <= h:
		res.append(1)
	else:
		res.append(2)
print(sum(res))


n = list(map(int, input().split()))
l = list(map(int, input().strip().split()))[:n[0]]
k = n[1]
c = len(l)
for i in range(len(l)):
	if l[i] > k:
		c = c + 1
print(c)


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


temp = input().split(' ')
n = int(temp[0])
h = int(temp[1])
array = input().split()
arr = []
for i in array:
	arr.append(int(i))
sum = 0
for i in arr:
	if i > h:
		sum = sum + 2
	else:
		sum = sum + 1
print(sum)


(_, h) = map(int, input().split())
arr = map(int, input().split())
print(sum(map(lambda a: 1 if a <= h else 2, arr)))


from sys import stdin, stdout

def main():
	(number_of_friends, height_of_fence) = [int(i) for i in stdin.readline().rstrip().split()]
	friends_height = [int(i) for i in stdin.readline().rstrip().split()]
	width_of_road = 0
	for h in friends_height:
		if h > height_of_fence:
			width_of_road += 2
		else:
			width_of_road += 1
	return width_of_road
print(main())


(n, x) = map(int, input().split())
arr = list(map(int, input().split()))
sol = 0
for i in arr:
	if i > x:
		sol = sol + 2
	else:
		sol += 1
print(sol)


width = 0
(n, h) = input().split()
numList = list((int(num) for num in input().strip().split()))[:int(n)]
for i in numList:
	if i <= int(h):
		width += 1
	else:
		width += 2
print(width)


(people, h) = input().split()
heights = [int(x) for x in input().split()]
total = 0
people = int(people)
h = int(h)
for height in heights:
	if height <= h:
		total += 1
	else:
		total += 2
print(total)


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


(a, b) = input().split()
a = int(a)
b = int(b)
w = 0
li = input().split()
for i in range(0, a):
	if int(li[i]) > b:
		w += 2
	else:
		w += 1
print(w)


d = 0
(a, b) = map(int, input().split())
c = list(map(int, input().split()))
for i in range(len(c)):
	if c[i] <= b:
		d = d + 1
	else:
		d = d + 2
print('{}'.format(d))


(n, h) = map(int, input().split())
lst = list(map(int, input().split()))
total = 0
for f in lst:
	if f > h:
		total += 2
	else:
		total += 1
print(total)


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


n = list(map(int, input().split()))
t = list(map(int, input().split()))
i = 0
c = 0
while i < n[0]:
	if t[i] <= n[1]:
		c += 1
	else:
		c += 2
	i += 1
print(c)


from fractions import Fraction
import sys
import bisect
import heapq
from math import *
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
mod = 1000000007

def inp():
	return sys.stdin.readline().strip()

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def graph(vertex):
	return [[] for i in range(0, vertex + 1)]

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(a, b):
	ans = 1
	while b > 0:
		if b % 2 == 1:
			ans *= a
		a *= a
		b //= 2
	return ans
(n, k) = map(int, input().split())
a = list(map(int, input().split()))
b = 0
for i in range(n):
	if a[i] > k:
		b += 2
	else:
		b += 1
print(b)


vf = input().split(' ')
secL = input().split(' ')
res = 0
for i in range(int(vf[0])):
	if int(secL[i]) <= int(vf[1]):
		res += 1
	elif int(secL[i]) <= int(vf[1]) * 2:
		res += 2
print(res)


(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)


(n, h) = tuple(map(int, input().strip().split()))
w = 0
for num in input().strip().split():
	if int(num) > h:
		w += 1
	w += 1
print(w)


(n, h) = map(int, input().split())
row = [int(x) for x in input().split()]
count = 0
for i in row:
	if i <= h:
		count += 1
	else:
		count += 2
print(count)


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


sinput = input()
sinput2 = input()
inp = sinput.split()
inp2 = sinput2.split()
n = int(inp[0])
h = int(inp[1])
a = inp2
sol = n
for i in a:
	if int(i) > h:
		sol += 1
print(sol)


(n, k) = [int(x) for x in input().split()]
L = [int(x) for x in input().split()]
print(len([1 for x in L if x <= k]) + 2 * len([1 for x in L if x > k]))


h = int(input().split()[1])
friends = [int(f) for f in input().split()]
print(sum([1 if f <= h else 2 for f in friends]))


(_, h) = map(int, input().split())
a = list(map(int, input().split()))
print(sum([(i > h) + 1 for i in a]))


(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
jsj = 0
for i in range(n):
	if a[i] > h:
		jsj += 1
print(int(jsj + n))


(numberOfPerson, heightOfFence) = input('').split()
numberOfPerson = int(numberOfPerson)
heightOfFence = int(heightOfFence)
width = 0
j = input().split()
for i in j:
	i = int(i)
	if i > heightOfFence:
		width += 2
	else:
		width += 1
print(width)


d = input().split()
(n, h) = (int(d[0]), int(d[1]))
d = input().split()
d = [int(x) for x in d]
S = 0
for i in d:
	if i > h:
		S += 2
	else:
		S += 1
print(S)


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


nm = [int(x) for x in input().split()]
friends = [int(x) for x in input().split()]
w = nm[0]
for i in friends:
	if i > nm[1]:
		w = w + 1
print(w)


x = [int(i) for i in input().split()]
people_height = [int(i) for i in input().split()]
num_people = x[0]
fence_height = x[1]
width = 0
for i in people_height:
	if i > fence_height:
		width += 2
	else:
		width += 1
print(width)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
print(n + sum((x > h for x in a)))


(number_of_friends, height_of_fence) = [int(i) for i in input().split()]
height_of_friends = [int(i) for i in input().split()]
count = 0
for i in height_of_friends:
	if i > height_of_fence:
		count += 2
	else:
		count += 1
print(count)


[n, h] = [int(x) for x in input().split(' ')]
a = [int(x) for x in input().split(' ')]
bend = sum((1 for p in a if p > h))
print(n + bend)


(x, y) = input().split(' ')
x = int(x)
y = int(y)
sum = 0
a = [int(x) for x in input().split()]
for i in range(0, x):
	if a[i] > y:
		sum += 2
	else:
		sum += 1
print(sum)


(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) = map(int, input().split())
i = list(map(int, input().split()))
res = 0
for num in i:
	res += 1 + (num > h)
print(res)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
width = len([ai for ai in a if ai > h]) * 2 + len([ai for ai in a if ai <= h])
print(width)


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


(fn, feh) = map(int, input().split())
fh = list(map(int, input().split()))
tw = 0
for j in range(int(fn)):
	if fh[j] <= feh:
		tw += 1
	else:
		tw += 2
mw = tw
print(mw)


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
count = 0
for i in l:
	if i > k:
		count += 1
print(n + count)


(n, h) = map(int, input().split())
p = [int(x) for x in input().split()]
cnt = n
for poo in p:
	if poo > h:
		cnt += 1
print(cnt)


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


(n, h) = [int(x) for x in input().split()]
friends = [int(x) for x in input().split()]
counter = 0
for i in friends:
	counter += 2 if i > h else 1
print(counter)


(n, h) = map(int, input().split())
seq = [int(x) for x in input().split()]
total_width = 0
for value in seq:
	if value > h:
		total_width += 2
	else:
		total_width += 1
print(total_width)


(n, a) = map(int, input().split())
N = [int(num) for num in input().split(' ', n - 1)]
i = 0
x = n
while i < n:
	if N[i] > a:
		x += 1
	i += 1
print(x)


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


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
count = 0
for i in range(n):
	if l[i] <= m:
		count += 1
	else:
		count += 2
print(count)


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


l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
for i in l2:
	if i > l1[1]:
		l1[0] += 1
print(l1[0])


def main():
	initial_input = []
	height = []
	min_height = 0
	j = 0
	init = input()
	initial_input = list(map(int, init.split()))
	init_height = input()
	height = list(map(int, init_height.split()))
	while j < len(height):
		if height[j] > initial_input[1]:
			min_height += 2
			j += 1
		elif height[j] < initial_input[1] or height[j] == initial_input[1]:
			min_height += 1
			j += 1
		else:
			pass
	print(min_height)
main()


s = input()
(n, h) = s.split()
n = int(n)
h = int(h)
l = list(input().split())
count = 0
for i in l:
	if int(i) > h:
		count += 2
	else:
		count += 1
print(count)


(persons, heightOfFence) = [int(i) for i in input().split()]
personsHeight = [int(i) for i in input().split()]
roadWidth = 0
while persons > 0:
	height = personsHeight[persons - 1]
	if height > heightOfFence:
		roadWidth = roadWidth + 2
	else:
		roadWidth = roadWidth + 1
	persons = persons - 1
print(roadWidth)


def main():
	(numberOfFriends, fenceHeight) = input('').split(' ')
	heights = input('').split(' ')
	currentWidth = 0
	for friend in range(int(len(heights))):
		if int(heights[friend]) <= int(fenceHeight):
			currentWidth = currentWidth + 1
		if int(heights[friend]) > int(fenceHeight):
			currentWidth = currentWidth + 2
	print(currentWidth)
main()


(n, h) = map(int, input().split())
a = [int(i) for i in input().split()]
nCount = 0
for i in range(n):
	if a[i] > h:
		nCount += 1
print(n + nCount)


(n, k) = map(int, input().split())
w = 1
l = list(map(int, input().split()))
for i in l:
	if i > k:
		w = w + 2
	else:
		w = w + 1
print(w - 1)


zabor = int(input().split()[1])
height = [int(x) for x in input().split()]
result = 0
for p in height:
	if p <= zabor:
		result += 1
	else:
		result += 2
print(result)


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


(n, h) = input().split()
n = int(n)
h = int(h)
a = input().split()
A = [int(x) for x in a]
L = []
c = 0
while c < len(A):
	if A[c] <= h:
		L.append(1)
		c += 1
	else:
		L.append(2)
		c += 1
print(sum(L))


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


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


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


(f, h) = map(int, input().split())
fh = list(map(int, input().split()))
ans = f
for i in range(len(fh)):
	if fh[i] > h:
		ans = ans + 1
print(ans)


i = []
import sys
for line in sys.stdin.readlines():
	i.append(line)
fence = [i[0].split()]
fence = int(fence[-1][-1])
persons = [int(p) for p in i[1].split()]
width = 0
for p in persons:
	width = width + 1 if p <= fence else width + 2
print(width)


l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
t = l1[1]
n = 0
for i in l2:
	if i > t:
		n = n + 2
	else:
		n = n + 1
print(n)


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


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


temp = input().split()
n = int(temp[0])
h = int(temp[1])
temp = input().split()
out = 0
for num in temp:
	t = int(num)
	if t > h:
		out += 2
	else:
		out += 1
print(out)


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
(x, y) = invr()
b = 0
for i in range(x):
	a = inlt()
	for num in a:
		if int(num) > int(y):
			b += 2
		else:
			b += 1
print(b)


(n, h) = map(int, input().split())
a = map(int, input().split())
width = n
for ai in a:
	if ai > h:
		width = width + 1
print(width)


line = list(map(int, input().split(' ')))
friends = list(map(int, input().split(' ')))
cnt = int('0')
for i in friends:
	if i <= line[1]:
		cnt += 1
	else:
		cnt += 2
print(cnt)


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
sum = 0
for x in a:
	sum += 1 if x <= m else 2
print(sum)


(n, k) = map(int, input().split())
l = [int(i) for i in input().split()]
s = 0
for i in l:
	if i <= k:
		s += 1
	else:
		s += 2
print(s)


height = int(input().split(' ')[-1])
heights = input()
heights = heights.split(' ')
heights = [int(each) for each in heights]
ans = 0
for each in heights:
	if each > height:
		ans += 2
	else:
		ans += 1
print(ans)


(a, b) = input().split(' ')
a = int(a)
b = int(b)
ar = list(map(int, input().strip().split(' ')))
sum = 0
i = 0
while a != i:
	if ar[i] > b:
		sum += 2
	else:
		sum += 1
	i += 1
print(sum)


entry_1 = input().split(' ')
entry_2 = input().split(' ')
sol = 0
for i in range(int(entry_1[0])):
	if int(entry_2[i]) <= int(entry_1[1]):
		sol += 1
	else:
		sol += 2
print(sol)


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


(n, k) = list(map(int, input().split()))
pp = 0
pl = list(map(int, input().split()))
for item in pl:
	if item <= k:
		pp += 1
	else:
		pp += 2
print(pp)


(n, h) = input().split()
widthOfRoad = 0
x = input().split()
for i in range(int(n)):
	if int(x[i]) <= int(h):
		widthOfRoad += 1
	elif int(x[i]) > int(h):
		widthOfRoad += 2
print(widthOfRoad)


(num_of_friends, fence_height) = input().split()
friends_height = input().split()
min_width = 0
for friend in friends_height:
	if int(friend) > int(fence_height):
		min_width += 2
	else:
		min_width += 1
print(min_width)


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


(n, m) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
e = 0
for i in range(0, len(a)):
	if a[i] <= m:
		e = e + 1
	else:
		e = e + 2
print(e)


(n, h) = map(int, input().split())
fen = list(map(int, input().split()))
res = 0
for o in fen:
	if o > h:
		res += 2
	else:
		res += 1
print(res)


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


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


(i, j) = map(int, input().split())
heights = list(map(int, input().split()))
width = 0
for _ in heights:
	if _ > j:
		width += 2
	else:
		width += 1
print(width)


arr = list(map(int, input().split()))
N = arr[0]
H = arr[1]
t = 0
arr = list(map(int, input().split()))
for x in arr:
	if x <= H:
		t += 1
	else:
		t += 2
print(t)


def checkBendPeople(people, h):
	sizeRoad = 0
	for i in people:
		if i <= h:
			sizeRoad += 1
		else:
			sizeRoad += 2
	return sizeRoad
t = input().split(' ')
n = int(t[0])
h = int(t[1])
people = [int(x) for x in input().split(' ')]
solution = checkBendPeople(people, h)
print(solution)


b = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = b[0]
for i in a:
	if i > b[1]:
		cnt += 1
print(cnt)


(n, h) = map(int, input().split())
arr = list(map(int, input().split()))
lomba = []
khato = []
for i in range(n):
	if arr[i] > h:
		lomba.append(arr[i])
	else:
		khato.append(arr[i])
print(len(lomba) * 2 + len(khato))


first_line_input = [int(i) for i in input().split()]
num_of_friends = first_line_input[0]
height_fence = first_line_input[1]
second_line = [int(j) for j in input().split()]
req_width = 0
for i in range(num_of_friends):
	if second_line[i] > height_fence:
		req_width += 2
	else:
		req_width += 1
print(req_width)


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


l = input().split()
n = int(l[0])
h = int(l[1])
l = input().split()
row = 0
for e in l:
	if int(e) > h:
		row += 2
	else:
		row += 1
print(row)


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


a = input()
b = []
b = a.split()
n = b[0]
h = b[1]
c = input()
d = []
d = c.split()
w = 0
for i in d:
	if int(i) > int(h):
		w += 2
	if int(i) <= int(h):
		w += 1
print(w)


(n, h) = [int(s) for s in input().split()]
a = [int(s) for s in input().split()]
w = 0
for v in a:
	if v <= h:
		w += 1
	else:
		w += 2
print(w)


s1 = input()
s1 = s1.split()
n = s1[0]
n = int(n)
n1 = s1[1]
n1 = int(n1)
x = []
c = 0
k = input()
k = k.split()
x = list(map(int, k))
for i in x:
	if i > n1:
		c += 2
	else:
		c += 1
print(c)


A = str(input())
A.split(' ')
(N, H) = A.split(' ')
N = int(N)
H = int(H)
f = 0
W = 0
Ni = input()
AMA = []
AMA.extend(Ni.split(' '))
for i in AMA:
	if int(i) > H:
		W = W + 2
	else:
		W = W + 1
print(W)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
count = 0
for i in range(len(a)):
	if a[i] <= h:
		count += 1
	elif a[i] > h and a[i] % h > 0:
		count += a[i] // h + 1
	elif a[i] > h and a[i] % h == 0:
		count += a[i] // h
print(count)


def met(a, b, d):
	r = 0
	for i in range(a):
		if d[i] > b:
			r += 2
		else:
			r += 1
	return r
(a, b) = tuple(map(int, input().split(' ')))
d = list(map(int, input().split(' ')))
print(met(a, b, d))


(n, k) = list(map(int, input().split()))
c = 0
l = map(int, input().split())
for j in l:
	if j > k:
		c += 1
s = 1 * n + c
print(s)


inp = input()
inplist = inp.split()
height = input()
heightlist = height.split()
len = 0
for k in range(0, int(inplist[0])):
	if int(heightlist[k]) > int(inplist[1]):
		len += 2
	else:
		len += 1
print(len)


a = input()
b = input()
n = int(a.split()[0])
Hwall = int(a.split()[1])
HIfriends = b.split()
Hfriends = []
y = 0
for i in range(n):
	m = int(b.split()[y])
	Hfriends.append(m)
	y = y + 1
x = 0
list = []
for i in Hfriends:
	if i <= Hwall:
		x = 1
	else:
		x = 2
	list.append(x)
print(sum(list))


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
k = [1 if i > b else 0 for i in c]
print(sum(k) + len(c))


def vanya(aList, k):
	count = 0
	for x in aList:
		if x > k:
			count += 2
		else:
			count += 1
	return count
(n, k) = map(int, input().strip().split(' '))
aList = list(map(int, input().strip().split(' ')))
answer = vanya(aList, k)
print(answer)


(n, h) = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
for i in range(n):
	if a[i] > h:
		a[i] = 2
	else:
		a[i] = 1
print(sum(a))


(n, h) = list(map(int, input().split()))
print(sum(list(map(lambda i: (i > h) + 1, list(map(int, input().split()))))))


[m, n] = [int(n) for n in input().split()]
arr = [int(n) for n in input().split()]
ans = 0
for a in arr:
	if a > n:
		ans += 2
	else:
		ans += 1
print(ans)


(nFriends, FenceH) = map(int, input().split())
friendsH = map(int, input().split())
c = nFriends
for friend in friendsH:
	if friend > FenceH:
		c += 1
print(c)


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


(n, h) = map(int, input().split())
a = map(int, input().split())
a = list(a)
i = 0
count = 0
while i < n:
	if a[i] > h:
		count += 2
	else:
		count += 1
	i += 1
print(count)


(n, height_fence) = input().split()
persons = list(map(int, input().split()))
n = int(n)
height_fence = int(height_fence)
not_to_bend = 1
to_bend = 2
sum_ = 0
for person in persons:
	if int(person) <= height_fence:
		sum_ += not_to_bend
	else:
		sum_ += to_bend
print(sum_)


std_intput = input().split()
height = int(std_intput[1])
width = 0
heights = input().split()
for h in heights:
	width += 1
	if int(h) > height:
		width += 1
print(width)


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

def shift(i):
	return 2 if int(i) > h else 1
print(sum((x for x in list(map(shift, input().split(' '))))))


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


(a, b) = map(int, input().split())
lst = list(map(int, input().split()))
count = 0
for i in lst:
	count += 1
	if i > b:
		count += 1
print(count)


(n, k) = list(map(int, input().split()))
arr = list(map(int, input().split()))
cnt = 0
for el in arr:
	if el > k:
		cnt += 2
	else:
		cnt += 1
print(cnt)


(n, h) = [int(x) for x in input().split()]
li = [int(y) for y in input().split()]
wid = 0
for i in range(n):
	if li[i] <= h:
		wid = wid + 1
	else:
		wid = wid + 2
print(wid)


(n, h) = [int(i) for i in input().split()]
hs = [int(i) for i in input().split()]
summ = 0
for el in hs:
	if el <= h:
		summ += 1
	else:
		summ += 2
print(summ)


h = [int(x) for x in input().split()][1]
print(sum([(int(x) > h) + 1 for x in input().split()]))


(n, k) = map(int, input().split())
a = [int(num) for num in input().split()]
res1 = 0
res2 = 0
for i in range(len(a)):
	if a[i] <= k:
		a[i] = 1
		res1 += a[i]
	else:
		a[i] = 2
		res2 += a[i]
print(res1 + res2)


(num, maxheight) = map(int, input().split())
heights = list(map(int, input().split()))
c = 0
for i in range(num):
	if heights[i] > maxheight:
		c += 2
	else:
		c += 1
print(c)


a = map(int, input().split())
l = []
for i in a:
	l.append(i)
b = map(int, input().split())
l1 = []
for j in b:
	l1.append(j)
h = l[1]
width = 0
for i in l1:
	if i <= h:
		width += 1
	else:
		width += 2
print(width)


(n, h) = [int(x) for x in input().split()]
res = n
a = [int(x) for x in input().split()]
for x in a:
	if x > h:
		res += 1
print(res)


(_, height) = [int(x) for x in input().strip().split()]
(height_list, cnt) = ([int(x) for x in input().strip().split()], 0)
for x in height_list:
	cnt += 2 if x > height else 1
print(cnt)


from sys import stdin
(n, h) = map(int, stdin.readline().split())
heights = [int(i) for i in stdin.readline().split()]
width = 0
for i in heights:
	if i > h:
		width += 2
	else:
		width += 1
print(width)


(n, h) = list(map(int, input().strip().split()))
a = list(map(int, input().strip().split()))
lst = []
for i in range(n):
	if a[i] <= h:
		lst.append(1)
	else:
		lst.append(2)
print(sum(lst))


(n, h) = map(int, input().split())
c = 0
s = [int(i) for i in input().split()]
for i in s:
	if i > h:
		c = c + 2
	elif i <= h:
		c = c + 1
print(c)


(n, h) = map(int, input().split())
cnt = 0
he = [int(x) for x in input().split()]
for i in range(0, n):
	if he[i] > h:
		cnt += 1
print(n - cnt + cnt * 2)


def main(args):
	nh = list(map(int, input().split(' ')))
	n = nh[0]
	h = nh[1]
	friends = list(map(int, input().split(' ')))
	count = 0
	for i in range(len(friends)):
		if h < friends[i]:
			count += 2
		else:
			count += 1
	print(count)
import sys
sys.exit(main(sys.argv))


try:
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	sum1 = 0
	for i in range(0, n):
		if a[i] > k:
			sum1 = sum1 + 2
		else:
			sum1 = sum1 + 1
	print(sum1)
except:
	pass


def fence(arr, h):
	ans = 0
	for i in arr:
		if i > h:
			ans += 2
		else:
			ans += 1
	return ans
x = list(map(int, input().rstrip().split()))
arr = list(map(int, input().rstrip().split()))
h = x[1]
print(fence(arr, h))


(n, h) = map(int, input().strip().split())
x = [int(i) for i in input().strip().split()]
y = 0
for i in x:
	if i > h:
		y += 2
	else:
		y += 1
print(y)


(quan_fr, h_fence) = input().split(' ')
h_fr = input().split(' ')
width = 0
for i in h_fr:
	width += int(i) > int(h_fence)
print(width + int(quan_fr))


def solve(n, h, a):
	w = len(a)
	for i in a:
		if i > h:
			w += 1
	return w
(n, h) = map(int, input().split())
a = list(map(int, input().split()))
print(solve(n, h, a))


(n, h) = list(map(int, input().split()))
friends = list(map(int, input().split()))
min_width = 0
for friend in friends:
	min_width += 1 if friend <= h else 2
print(min_width)


(_, h) = input().split(' ')
h = int(h)
heights = input().split(' ')
width = 0
for height in heights:
	if int(height) > h:
		width += 2
	else:
		width += 1
print(width)


inp = input()
inp = inp.split(' ')
num_friends = int(inp[0])
height_of_fence = int(inp[1])
list_of_friends_height = input()
lst = list_of_friends_height.split(' ')
answer = 0
for current_height in lst:
	if int(current_height) > height_of_fence:
		answer += 2
	else:
		answer += 1
print(answer)


try:
	l = list(map(int, input().split()))
	m = list(map(int, input().split()))
	c = 0
	for i in range(0, l[0]):
		if m[i] > l[1]:
			c += 2
		else:
			c += 1
	print(c)
except:
	pass


import math
(n, h) = map(int, input().split())
height = input().split()
print(sum([math.ceil(int(height_each) / h) for height_each in height]))


a = input().split()
b = int(a[1])
c = input().split()
for i in range(len(c)):
	c[i] = int(c[i])
d = int(0)
for j in range(len(c)):
	if c[j] > b:
		d += 2
	else:
		d += 1
print(int(d))


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


f_input = input()
f_input_s = f_input.split(' ')
no_of_times = int(f_input_s[0])
height = int(f_input_s[1])
x = 0
answer = 0
s_input = input()
s_input_s = s_input.split(' ')
for n in range(no_of_times):
	if int(s_input_s[x]) <= height:
		answer = answer + 1
	else:
		answer = answer + 2
	x = x + 1
print(answer)


line = input().split(' ')
n = int(line[0])
h = int(line[1])
res = n
line = input().split(' ')
for curr in line:
	if int(curr) > h:
		res += 1
print(res)


(n, h) = str.split(input())
elem = str.split(input())
width = int(n)
for i in elem:
	if int(i) > int(h):
		width += 1
print(width)


list1 = list(map(int, input().split()))
heights = list(map(int, input().split()))
n = list1[0]
max_height = list1[1]
width = 0
for el in heights:
	if el > max_height:
		width += 2
	else:
		width += 1
print(width)


WIDTH_USUAL = 1
WIDTH_BENT = 2

def calc_width(*args):
	people = args[0]
	height = args[1]
	people = args[2:]
	width_sum = 0
	for p in people:
		width_sum += WIDTH_USUAL if p <= height else WIDTH_BENT
	return width_sum
line1 = input().split()
line2 = input().split()
line1 = [int(x) for x in line1]
line2 = [int(x) for x in line2]
data = line1 + line2
print(calc_width(*data))


(a, b) = map(int, input().split())
lis = list(map(int, input().split()))
ans = 0
for i in lis:
	if i > b:
		ans += 2
	else:
		ans += 1
print(ans)


(a, b) = map(int, input().split())
l = list(map(int, input().split()))
count = 0
for k in l:
	if k > b:
		count += 2
	else:
		count += 1
print(count)


def first():
	inp = input().split(' ')
	h = int(inp[1])
	inp = input().split(' ')
	a = list(map(int, inp))
	counter = 0
	for i in a:
		if i > h:
			counter += 2
		else:
			counter += 1
	print(counter)
first()


(n, h) = input().split()
a = input().split()
n = int(n)
h = int(h)
sum = 0
i = 0
while i < len(a):
	a[i] = int(a[i])
	i = i + 1
i = 0
while i < n:
	if a[i] > h:
		sum = sum + 2
	else:
		sum = sum + 1
	i = i + 1
print(sum)


(n, h) = (int(e) for e in input().split(' '))
heights = list(input().split(' '))
numberOfTwos = 0
numberOfOnes = 0
for i in range(0, n):
	if int(heights[i]) > h:
		numberOfTwos += 1
	else:
		numberOfOnes += 1
print(numberOfTwos * 2 + numberOfOnes)


line1 = input()
line2 = input()
n = line1.split()[0]
h = line1.split()[1]
people = line2.split()
width = 0
for x in people:
	if int(x) > int(h):
		width += 2
	else:
		width += 1
print(width)


(a, b) = map(int, input().split())
lst = []
c = map(int, input().split())
for x in c:
	lst.append(x)
count = a
for z in lst:
	if z > b:
		count += 1
print(count)


arreglo_input_1 = input().split()
total_amigos = int(arreglo_input_1[0])
altura_reja = int(arreglo_input_1[1])
arreglo_input_2 = input().split()
ancho_fila = 0
for cada_altura in arreglo_input_2:
	if int(cada_altura) > altura_reja:
		ancho_fila += 2
	else:
		ancho_fila += 1
print(ancho_fila)


import sys

def a(an, h):
	return len(an) + len([i for i in an if i > h])

def readline():
	return list(map(int, input().split()))
(n, h) = readline()
an = readline()
print(a(an, h))
sys.exit(0)


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


x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
hsl = 0
for i in range(len(y)):
	if y[i] > x[1]:
		hsl += 2
	else:
		hsl += 1
print(hsl)


def fence(n, h, heights):
	w = 0
	for height in heights:
		if height > h:
			w += 2
		else:
			w += 1
	return w
(n, h) = map(int, input().split(' '))
heights = map(int, input().split(' '))
print(fence(n, h, heights))


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


(n, h) = input().split()
n = int(n)
h = int(h)
b = 0
c = 0
d = 0
a = map(int, input().split())
for e in a:
	if e <= h:
		b = b + 1
	elif e > h:
		c = c + 2
print(b + c)


s = input().split(' ')
n = int(s[0])
h = int(s[1])
a = input().split(' ')
k = n
for i in range(n):
	a[i] = int(a[i])
	if a[i] > h:
		k += 1
print(k)


def main():
	friends = []
	result = 0
	(n, h) = map(int, input().split())
	friends = list(map(int, input().split()))
	for friend in friends:
		if friend > h:
			result += 2
		else:
			result += 1
	print(result)
main()


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


(n, h) = input().split()
number_of_persons = int(n)
height_of_fence = int(h)
height_of_each_person_string = input()
height_of_each_person_list_of_string = height_of_each_person_string.split()
height_of_each_person_list_of_integer = [int(i) for i in height_of_each_person_list_of_string]
minimum_street_width = 0
for height_of_a_person_in_this_list in height_of_each_person_list_of_integer:
	if height_of_a_person_in_this_list > height_of_fence:
		minimum_street_width = minimum_street_width + 2
	else:
		minimum_street_width = minimum_street_width + 1
print(minimum_street_width)


d = input()
d = d.split(' ')
h = int(d[1])
x = input()
x = x.split(' ')
final = 0
for i in x:
	if int(i) <= h:
		final += 1
	else:
		final += 2
print(final)


from sys import stdin
(n, h) = map(int, stdin.readline().split())
arr = list(map(int, stdin.readline().split()))
c = 0
for i in arr:
	if i <= h:
		c += 1
	else:
		c += 2
print(c)


n = list(map(int, input().split()))
m = list(map(int, input().split()))
a = n[0]
for i in range(n[0]):
	if m[i] > n[1]:
		a += 1
print(a)


(n, h) = map(int, input().split())
tab = map(int, input().split())
widths = []
for i in tab:
	if i > h:
		widths.append(2)
	else:
		widths.append(1)
print(sum(widths))


(n, s) = map(int, input().split())
l = list(map(int, input().split()))
ans = 0
for i in range(n):
	if l[i] <= s:
		ans += 1
		l[i] = 0
	while l[i] > s:
		ans = ans + l[i] // s
		l[i] = l[i] % s
for i in l:
	if 0 < i < s:
		ans += 1
print(ans)


import array
arr = array.array('l', [])
arr1 = array.array('l', [])
arr1 = [int(i) for i in input().split()]
n = int(arr1[0])
k = int(arr1[1])
arr = [int(i) for i in input().split()]
dd = 0
for i in range(0, n, 1):
	if arr[i] > k:
		dd = dd + 2
	else:
		dd = dd + 1
print(dd)


lis = input()
lis = lis.split()
n = int(lis[0])
h = lis[1]
c = 0
lis = input()
lis = lis.split()
for i in range(n):
	if int(lis[i]) > int(h):
		c += 2
	elif int(lis[i]) <= int(h):
		c += 1
print(c)


nandh = input()
people = input()
nandhlist = nandh.split(' ')
heights = list(map(int, people.split(' ')))
n = int(nandhlist[0])
h = int(nandhlist[1])
minwidth = 0
for height in heights:
	if height > h:
		minwidth += 2
	else:
		minwidth += 1
print(minwidth)


(n, h) = input().split()
n = int(n)
h = int(h)
lenght = n
height = input().split()
for p in height:
	p = int(p)
	if p > h:
		lenght += 1
print(lenght)


no = list(map(int, input().strip().split()))
n = int(no[0])
h = int(no[1])
flag = 0
heights = list(map(int, input().strip().split()))
for i in range(n):
	if heights[i] > h:
		flag += 1
print(n + flag)


(a, b) = map(int, input().split())
d = 0
c = list(map(int, input().split()))
for i in range(a):
	e = b
	while True:
		c[i] = c[i] - e
		d = d + 1
		if c[i] <= 0:
			break
print(d)


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


(n, k) = map(int, input().split())
a = [int(i) for i in input().split()]
s = n
for i in a:
	if i > k:
		s += 1
print(s)


def intmaker(arr):
	for i in range(len(arr)):
		arr[i] = int(arr[i])
	return arr
(n, h) = input().split()
n = int(n)
h = int(h)
x = input().split()
x = intmaker(x)
count = 0
for i in range(len(x)):
	if x[i] > h:
		count += 2
	else:
		count += 1
print(count)


def minimum_road_width(n, a):
	number_of_friend = n[0]
	height = n[1]
	width = 0
	for index in range(number_of_friend):
		if a[index] > height:
			width += 2
		else:
			width += 1
	return width
n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
print(minimum_road_width(n, a))


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


h = list(map(int, input().split(' ')))[1]
frien = list(map(int, input().split(' ')))
count = len(frien)
for i in frien:
	if i > h:
		count += 1
print(count)


n = [int(x) for x in input().split(' ')]
l = [int(x) for x in input().split(' ')]
sum1 = 0
for i in l:
	if i <= n[1]:
		sum1 = sum1 + 1
	else:
		sum1 = sum1 + 2
print(sum1)


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


(n, h) = map(int, input().split())
mylist = list(map(int, input().split()))
count = 0
if len(mylist) != n:
	print('invalid ')
for i in range(n):
	if mylist[i] > h:
		if mylist[i] <= 2 * h and mylist[i] >= 1:
			count = count + 1
x = count + n
print(x)


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


(n, h) = map(int, input().split())
a = map(int, input().split())
print(n + sum(map(lambda ai: int(ai > h), a)))


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


p = input()
s = [int(i) for i in p.split()]
p = input()
t = [int(i) for i in p.split()]
cout = 0
for i in t:
	if i <= s[1]:
		cout = cout + 1
	else:
		cout = cout + 2
print(cout)


(n, fence) = [int(x) for x in input().split(' ')]
kids = [int(x) for x in input().split(' ')]
sum = 0
for k in kids:
	sum += 1 if k <= fence else 2
print(sum)


(n, h) = [int(i) for i in input().split()]
n_heights = [int(i) for i in input().split()]
total_width = 0
for i in n_heights:
	if i > h:
		total_width += 2
	else:
		total_width += 1
print(total_width)


def Fence(n, h, a):
	res = 0
	for i in range(n):
		if a[i] <= h:
			res = res + 1
		else:
			res = res + 2
	return res
(x, y) = input().split()
s = [int(n) for n in input().split()]
print(Fence(int(x), int(y), s))


(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
num = 0
for y in a:
	if y > h:
		num = num + 1
print(num + n)


def tusk(s):
	count_d = 0
	count_a = 0

def tusk(nums, h):
	res = 0
	for n in nums:
		if n <= h:
			res += 1
		else:
			res += 2
	return res
(n, h) = map(int, input().split())
num = list(map(int, input().split()))
print(tusk(num, h))


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
double = sum([1 for i in a if i > h])
print(len(a) + double)


(n, height) = map(int, input().split())
friend = list(map(int, input().split()))
wideth = 0
for i in friend:
	if i > height:
		wideth += 2
	else:
		wideth += 1
print(wideth)


(nos, fheight) = list(map(int, input().split()))
pheight = list(map(int, input().split()))
print(sum([2 if x > fheight else 1 for x in pheight]))


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


(a, b) = map(int, input().split())
x = list(map(int, input().split()))
y = []
for i in x:
	if i > b:
		y.append(2)
	else:
		y.append(1)
print(sum(y))


from typing import List
(n, h) = input().split(' ')
n = int(n)
h = int(h)
a: List[str] = input().split(' ')
count = 0
for i in range(len(a)):
	if int(a[i]) > h:
		count += 2
	else:
		count += 1
print(count)


[n, h] = [int(i) for i in input().split()]
f = [int(int(i) > h) for i in input().split()]
print(sum(f) + n)


(n, k) = map(int, input().split())
asd = [int(n) for n in input().split()]
for i in range(len(asd)):
	if asd[i] > k:
		n = n + 1
	else:
		pass
print(n)


n = input().split()
s = input().split()
my_list = []
count = 0
for i in n:
	my_list.append(int(i))
x = my_list[1]
for v in s:
	c = int(v)
	if c <= x:
		count += 1
	else:
		count += 2
print(count)


(counter, height) = map(int, input().split())
arr = list(map(int, input().split()))
count = 0
for n in arr:
	if n <= height:
		count += 1
	else:
		count += 2
print(count)


try:
	(n, h) = input().split()
	n = int(n)
	h = int(h)
	arr = [int(ele) for ele in input().split()]
	output = 0
	for i in arr:
		if i <= h:
			output += 1
		else:
			output += 2
	print(output)
except Exception:
	pass


(n, h) = map(int, input().split())
persons = map(int, input().split())
width = 0
for person in persons:
	if person > h:
		width += 2
	else:
		width += 1
print(width)


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


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


import bisect
import collections
import copy
import functools
import heapq
import itertools
import math
import random
import re
import sys
import time
import string
from typing import List
sys.setrecursionlimit(99999)

def II():
	return int(sys.stdin.readline().strip())

def IIs():
	return list(map(int, sys.stdin.readline().strip().split()))

def SI():
	return sys.stdin.readline().strip()
(n, h) = IIs()
print(n + sum((x > h for x in IIs())))


(a, b) = input().split()
count = 0
a = int(a)
b = int(b)
list = list(input().split())
list = [int(x) for x in list]
for x in list:
	if x > b:
		count = count + 2
	else:
		count = count + 1
print(count)


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


(no_of_frnds, ht_fence) = map(int, input().split())
x = list(map(int, input().split()))
k = 0
for i in x:
	if i > ht_fence:
		k = k + 2
	else:
		k += 1
print(k)


h = input()
x = h.split()
y = int(x[0])
width = 0
z = int(x[1])
a = input()
lst = a.split()
for i in range(len(lst)):
	if int(lst[i]) > z:
		width += 2
	else:
		width += 1
print(width)


n = str(input())
list = n.split(' ')
n = int(list[0])
k = int(list[1])
res = 0
list = str(input()).split(' ')
for i in list:
	x = int(i)
	if x <= k:
		res += 1
	else:
		res += 2
print(res)


(n, h) = map(int, input().split())
a = [int(i) for i in input().split()]
count = 0
s1 = [1 for i in range(n) if a[i] > h]
print(n + sum(s1))


s = input().split()
n = int(s[0])
h = int(s[1])
b = input().split()
sum = 0
for i in range(len(b)):
	if int(b[i]) <= h:
		sum += 1
	else:
		sum += 2
print(sum)


(x, h) = input().split()
y = input().split()
ans = int(x)
for i in y:
	if int(i) > int(h):
		ans += 1
print(ans)


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


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
t = 0
for i in l:
	w = 1
	while i > h:
		w += 1
		i -= h
	t += w
print(t)


width = 0
nums = input().split()
(n, h) = [int(nums[i]) for i in range(0, 2)]
heights = [int(j) for j in input().split()]
for x in heights:
	if x > h:
		width += 2
	else:
		width += 1
print(width)


(n, h) = tuple(map(int, input().split()))
people = list(map(int, input().split()))
width = 0
for person in people:
	if person > h:
		width += 2
	else:
		width += 1
print(width)


(n, h) = [int(x) for x in input().split(' ')]
ar = input().split(' ')
res = 0
for i in ar:
	if int(i) > h:
		res += 2
	else:
		res += 1
print(res)


inp = input()
arr = inp.split(' ')
n = int(arr[0])
h = int(arr[1])
inp = input()
arr = inp.split(' ')
res = 0
for x in arr:
	if int(x) > h:
		res += 2
	else:
		res += 1
print(res)


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


(n, h) = [int(x) for x in input().split()]
h_list = [int(y) for y in input().split()]
width = 0
for i in h_list:
	if i > h:
		width += 2
	else:
		width += 1
print(width)


(k, r) = map(int, input().split())
x = list(map(int, input().split()))
count = 0
for i in x:
	if i > r:
		count = count + 2
	else:
		count = count + 1
print(count)


(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)


x = input()
x = x.split()
numbers = int(x[0])
height = int(x[1])
friends_height = input()
friends_height = friends_height.split()
width = 0
for i in range(numbers):
	if int(friends_height[i]) > int(height):
		width += 1
	width += 1
print(width)


def get_line_as_int_list():
	return list(map(int, input().split(' ')))

def main():
	(_, max_hight) = get_line_as_int_list()
	row = get_line_as_int_list()
	filtered_lst = list(map(lambda x: 1 if x <= max_hight else 2, row))
	print(sum(filtered_lst))
main()


first = input()
second = input()
tmp = first.split()
(n, h) = (int(tmp[0]), int(tmp[-1]))
friends = map(lambda x: int(x), second.split())
mn_h = 0
for fr in friends:
	if fr > h:
		mn_h += 2
	else:
		mn_h += 1
print(mn_h)


(n, h) = map(int, input().split())
l = map(int, input().split())
sum = 0
for p in l:
	if p > h:
		sum += 2
	else:
		sum += 1
print(sum)


[n, h] = [int(x) for x in input().split()]
minWidth = n
for num in [int(x) for x in input().split()]:
	if num > h:
		minWidth += 1
print(minWidth)


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


s = input().split()
l = input().split()
count = 0
for i in range(int(s[0])):
	if int(s[1]) >= int(l[i]):
		count += 1
	else:
		count += 2
print(count)


test = input().split()
n = int(test[0])
h = int(test[1])
friends = [int(i) for i in input().split()]
res = 0
for e in friends:
	res += 1
	if e > h:
		res += 1
print(str(res))


(n, h) = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
line = 0
for i in range(n):
	if p[i] <= h:
		line += 1
		i += 1
	else:
		line += 2
		i += 1
print(line)


(n, h) = [int(x) for x in input().split()]
ipt = [0 if int(x) > h else int(x) for x in input().split()]
print(len(ipt) + ipt.count(0))


(x, y) = map(int, input().split())
l = list(map(int, input().split()))
out = x
for i in l:
	if i > y:
		if i % y == 0:
			out += int(i / y) - 1
		else:
			out += i // y
print(out)


n_h = input().split()
n = int(n_h[0])
h = int(n_h[1])
array = [int(i) for i in input().split()]
sum_w = 0
for person_h in array:
	if person_h <= h:
		sum_w += 1
	else:
		sum_w += 2
print(sum_w)


x = input()
a = [int(n) for n in x.split()]
n = a[0]
m = a[1]
x = input()
a = [int(n) for n in x.split()]
ans = 0
for i in a:
	if i > m:
		ans += 2
	else:
		ans += 1
print(ans)


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


def main():
	(n, h) = map(int, input().split())
	a = list(map(int, input().split()))
	print(sum([1 if e <= h else 2 for e in a]))
main()


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


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


x = list(input().split(' '))
y = list(input().split(' '))
summ = 0
c = 0
for i in range(0, int(x[0])):
	if int(x[1]) >= int(y[i]):
		c = 1
	else:
		c = 2
	summ = summ + c
print(summ)


(a, b) = input().split()
friends = list(input().split())
sm = 0
for friend in friends:
	if int(friend) > int(b):
		sm += 2
	else:
		sm += 1
print(sm)


n = input()
n = n.split()
p = int(n[0])
q = int(n[1])
m = input()
m = m.split()
c = 0
for i in range(len(m)):
	if int(m[i]) > q:
		c = c + 2
	else:
		c = c + 1
print(c)


(m, n) = map(int, input().split())
q = 0
s = map(int, input().split())
for i in s:
	if i <= n:
		q += 1
	else:
		q += 2
print(q)


(n, h) = map(int, input().split())
hs = map(int, input().split())
res = 0
for r in hs:
	if r > h:
		res += 2
	else:
		res += 1
print(res)


(hm, fence_height) = input().split(' ')
hm = int(hm)
fence_height = int(fence_height)
heights = input().split(' ')
width = hm
for i in range(hm):
	heights[i] = int(heights[i])
	if heights[i] > fence_height:
		width += 1
print(width)


(n, k) = map(int, input().split())
ls = list(map(int, input().split()))
count = 0
for i in ls:
	if i > k:
		count += 1
print(count * 2 + n - count)


(n, h) = map(int, input().split())
s = input().split()
k = 0
for i in s:
	if int(i) <= h:
		k = k + 1
	elif int(i) % h == 0:
		k = k + int(i) // h
	else:
		k = k + int(i) // h + 1
print(k)


(n, h) = map(int, input().split())
w = 0
p = input().split()
for loop in range(n):
	if int(p[loop]) > h:
		w += 2
	else:
		w += 1
print(w)


INPUT_DATA_A = str(input()).split(' ')
INPUT_DATA_B = str(input()).split(' ')
WEIGHT = 0
HEIGHT = int(INPUT_DATA_A[1])
for i in INPUT_DATA_B:
	PERSON_HEI = int(i)
	if PERSON_HEI > HEIGHT:
		WEIGHT += 2
	else:
		WEIGHT += 1
print(WEIGHT)


(n, h) = map(int, input().split())
x = 0
listi = [int(i) for i in input().split()]
for i in listi:
	if i <= h:
		x = x + 1
	else:
		x = x + 2
print(x)


(n, h) = map(int, input().split())
friends = list(map(int, input().split()))
b = 0
for i in friends:
	if i > h:
		b += 1
print(2 * b + len(friends) - b)


a = input()
b = input()
r = 0
for i in b.split(' '):
	if int(i) <= int(a.split(' ')[1]):
		r += 1
	else:
		r += 2
print(r)


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


A = list(map(int, input().split()))
friends = A[0]
height = A[1]
width = 0
B = list(map(int, input().split()))
for i in range(friends):
	if B[i] > height:
		width += 1
print(width + friends)


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


total = 0
(x, h) = input().split()
(x, h) = [int(x), int(h)]
a = [int(x) for x in input().split()]
for item in a:
	if item > h:
		total += 2
	else:
		total += 1
print(total)


n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
sogn = [1 if i <= n[1] else 2 for i in a]
print(sum(sogn))


n_h = input().split()
A = input().split()
b = 0
for i in range(0, int(n_h[0])):
	if int(A[i]) <= int(n_h[1]):
		b += 1
	else:
		b += 2
print(b)


(a, b) = map(int, input().split())
c = input().split()
print(sum((int(i) > b for i in c)) + len(c))


(a, b) = map(int, input().split(' '))
l = map(int, input().split(' '))
m = 0
for i in l:
	if i > b:
		m = m + 2
	else:
		m = m + 1
print(m)


[n, m] = [int(x) for x in input().split()]
height = [int(x) for x in input().split()]
height_tall = [x for x in height if x > m]
height_short = [x for x in height if x <= m]
print(len(height_short) + 2 * len(height_tall))


a = input().split()
b = input().split()
count = 0
for n in b:
	if int(n) > int(a[1]):
		count = count + 2
	else:
		count = count + 1
print(count)


__author__ = 'zihaozhu'
from sys import stdin
(people, fence) = map(int, stdin.readline().split())
height = list(map(int, stdin.readline().split()))
count = 0
for i in range(0, people):
	if height[i] > fence:
		count += 2
	else:
		count += 1
print(count)


strs1 = input().split()
n = int(strs1[0])
h = int(strs1[1])
strs2 = input().split()
i = 0
w = 0
for i in range(0, n):
	if int(strs2[i]) > h:
		w += 2
	else:
		w += 1
print(w)


(n, h) = [int(i) for i in input().split()]
heights = [int(i) for i in input().split()]
widths = [1 if height <= h else 2 for height in heights]
print(sum(widths))


(n, h) = input().split()
(n, h) = (int(n), int(h))
A = input()
Sum = 0
for i in A.split():
	if int(i) > h:
		Sum = Sum + 1
print(n + Sum)


(first_line, second_line) = input().split()
first_line = int(first_line)
second_line = int(second_line)
i_height = input().split()
normal_width = 1
bit_width = 2
min_width_of_the_road = 0
for i in i_height:
	if int(i) > second_line:
		min_width_of_the_road += 2
	elif int(i) <= second_line:
		min_width_of_the_road += 1
print(min_width_of_the_road)


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
width = n
for i in range(n):
	if a[i] > k:
		width += 1
print(width)


(n, k) = input().split()
n = int(n)
k = int(k)
num = 0
lst = [int(x) for x in input().split()]
for i in lst:
	if i > k:
		num += 2
	else:
		num += 1
print(num)


numbers = list(map(int, input().split()))
output = list(map(int, input().split()))
width = 0
i = 0
for i in range(len(output)):
	if output[i] <= numbers[1]:
		width += 1
	else:
		width += 2
	i += 1
print(width)


(n, h) = map(int, input().split(' '))
li = list(map(int, input().split(' ')))
k = 0
for i in li:
	if i <= h:
		k += 1
	else:
		k += 2
print(k)


(n, k) = [int(i) for i in input().split()]
c = 0
for i in input().split():
	i = int(i)
	if i > k:
		c += 1
	c += 1
print(c)


(n, h) = input().split()
heights = input().split()
n = int(n, 10)
h = int(h, 10)
w = 0
for height in heights:
	if int(height, 10) > h:
		w += 1
	w += 1
print(w)


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


def width_road(height_friends):
	count = 0
	for value in height_friends:
		if value <= height_of_fence:
			count += 1
		elif value > height_of_fence and value // 2 <= height_of_fence:
			count += 2
	return count
(people, height_of_fence) = map(int, input().split())
lst = list(map(int, input().split()))
print(width_road(lst))


(n, h) = [int(x) for x in input().split()]
bends = [int(x) for x in input().split() if int(x) > h]
print(len(bends) + n)


(n, h) = map(int, input().split())
hl = list(map(int, input().split()))
output = 0
for i in hl:
	if i <= h:
		output = output + 1
	else:
		output = output + 2
print(output)


import functools
(total, fence) = map(int, input().split())
people = map(int, input().split())
cnt = functools.reduce(lambda r, e: r + 2 if e > fence else r + 1, people, 0)
print(cnt)


vals = str(input())
vals2 = str(input())
thing = vals.split(' ')
num = int(thing[0])
hof = int(thing[1])
val2 = vals2.split(' ')
width = num
for n in range(num):
	if int(val2[n]) > hof:
		width += 1
print(width)


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


from collections import deque
(n, h) = list(map(int, input().split()))
f = []
f.extend(list(map(int, input().rstrip().split())))
count = 0
for i in range(n):
	if f[i] > h:
		count += 1
min_width = 2 * count + (n - count)
print(min_width)


ed = input().split()
a = int(ed[0])
b = int(ed[1])
d = []
f = 0
edd = input().split()
for i in range(a):
	c = int(edd[i])
	d.append(c)
for j in d:
	if j > b:
		f += 2
	elif j <= b:
		f += 1
print(f)


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


(n, k) = map(int, input().split())
arr = [int(i) for i in input().split()]
count = 0
for i in arr:
	if i > k:
		count += 2
	else:
		count += 1
print(count)


(n, h) = map(int, input().split())
p = list(map(int, input().split()))
c = 0
for j in range(len(p)):
	if p[j] < h or p[j] == h:
		c = c + 1
	else:
		c = c + 2
print(c)


(n, h) = input().split()
number = int(n)
height = int(h)
a = input().split()
p = list(a)
for j in range(0, len(p)):
	p[j] = int(p[j])
sum = 0
i = 0
for i in range(number):
	if p[i] > height:
		width = 2
	else:
		width = 1
	sum = sum + width
	i = i + 1
print(sum)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
ans = 0
for li in l:
	if li <= h:
		ans += 1
	else:
		ans += 2
print(ans)


(nbPersonnes, hauteur) = map(int, input().split())
tailles = list(map(int, input().split()))
largeur = 0
for taille in tailles:
	if taille <= hauteur:
		largeur += 1
	else:
		largeur += 2
print(largeur)


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


NyH = input('')
Todos = input('')
NyH = NyH.split()
N = int(NyH[0])
H = int(NyH[1])
Todos = Todos.split()
Cont = 0
for K in range(len(Todos)):
	if int(Todos[K]) <= H:
		Cont = Cont + 1
	else:
		Cont = Cont + 2
print(Cont)


(n, h) = map(int, input().split())
row = 0
ai = input().split()
for i in ai:
	i = int(i)
	if h < i and i <= 2 * h:
		row += 2
	else:
		row += 1
print(row)


(n, h) = tuple(input().split(' '))
n = int(n)
h = int(h)
bent = 0
l = input().split(' ')
l1 = []
for i in l:
	l1.append(int(i))
del l
for i in l1:
	if i > h:
		bent += 1
print(2 * bent + n - bent)


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


(a, b) = map(int, input().split())
l = list(map(int, input().split()))
d = a
for i in l:
	if i > b:
		d = d + 1
print(d)


def bent(m, p):
	if m > p:
		return 2
	else:
		return 1
width = 0
(n, h) = map(int, input().split())
heights = list(map(int, input().split()))
for height in heights:
	width += bent(height, h)
print(width)


(n, h) = map(int, input().split())
heights = [int(x) for x in input().split()]
Count = 0
for i in heights:
	if i > h:
		Count += 2
	else:
		Count += 1
print(Count)


(n_size, h) = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in arr:
	if i <= h:
		ans += 1
	else:
		ans += 2
print(ans)


import math
(a, b) = map(int, input().split())
c = list(map(int, input().split()))
s = 0
for i in range(a):
	if c[i] < b:
		s += 1
	else:
		s += math.ceil(c[i] / b)
print(s)


import sys

def main():
	fl = sys.stdin.readline()
	(num_friends, fence_height) = fl.split(' ')
	heights = sys.stdin.readline()
	heights = heights.split(' ')
	heights = [int(height) for height in heights]
	fence_height = int(fence_height)
	ans = min_possible_road_width(heights, fence_height)
	print(ans)

def min_possible_road_width(heights, fence_height):
	width = 0
	for height in heights:
		if height > fence_height:
			width += 2
		else:
			width += 1
	return width
main()


(n, h) = map(int, input().split())
a = input().split()
k = 0
for i in range(len(a)):
	if int(a[i]) <= h:
		k += 1
	else:
		k += 2
print(k)


def maxWidth(height, friends):
	width = 0
	for friend in friends:
		if int(friend) <= height:
			width += 1
		elif int(friend) > height:
			width += 2
	return width
listOfInputs = input().split()
friendsList = input().split()
print(maxWidth(int(listOfInputs[1]), friendsList))


(a, b) = map(int, input().split())
c = [int(x) for x in input().split()]
sum = 0
for i in c:
	if i <= b:
		sum = sum + 1
	elif i > b:
		sum = sum + 2
print(sum)


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


(n, h) = input().split()
a = input().split()
tab = []
b = 0
for _ in range(0, len(a)):
	tab.append(str(a[_]))
for i in tab:
	if int(i) > int(h):
		b += 2
	else:
		b += 1
print(b)


(n, h) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
print(n + sum([int(i > h) for i in l]))


from sys import stdin, stdout

def solve():
	(n, h) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	assert len(a) == n
	w = len(a)
	for p in a:
		if p > h:
			w += 1
	print(w)

def main():
	solve()
main()


(n, h) = map(int, input().split())
cnt = sum((int(int(x) <= h) for x in input().split()))
print(2 * n - cnt)


(a, b) = map(int, input().split())
n = list(map(int, input().split()))
if a != len(n):
	exit(0)
else:
	count = 0
	for x in n:
		if x > b:
			count = count + 2
		else:
			count = count + 1
	print(count)


input1 = input()
Lis = input1.split(' ')
List = []
for j in range(0, 2):
	List.append(int(Lis[j]))
numOfFriends = List[0]
hieght = List[1]
input2 = input()
Lis2 = input2.split(' ', numOfFriends)
List2 = []
for jj in range(0, numOfFriends):
	List2.append(int(Lis2[jj]))
result = 0
for i in List2:
	if i > hieght:
		result += 2
	else:
		result += 1
print(result)


(number, height) = map(int, input().strip().split())
heights = list(map(int, input().strip().split()))
ans = sum((1 if h <= height else 2 for h in heights))
print(ans)


from sys import stdin

def parse():
	line = stdin.readline().split()
	(N, H) = (int(line[0]), int(line[1]))
	line = stdin.readline().split()
	ints = map(int, line)
	ans = 0
	for item in ints:
		ans = ans + 2 if item > H else ans + 1
	print(ans)
parse()


height = int(input().split(' ')[1])
ppl = [int(x) for x in input().split(' ')]
width = 0
for x in ppl:
	if x > height:
		width += 2
	else:
		width += 1
print(width)


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


(n, h) = map(int, input().split())
hts = list(map(int, input().split()))
wide = 0
for i in range(n):
	if hts[i] / h <= 1:
		wide += 1
	else:
		wide += 2
print(wide)


(a, b) = [int(i) for i in input().split()]
print(sum((2 if int(i) > b else 1 for i in input().split())))


(n, h) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
ans = n
for elem in a:
	if elem > h:
		ans += 1
print(ans)


(n, h) = map(int, input().split())
a = [int(s) for s in input().split()]
cnt = 0
for i in a:
	if i <= h:
		cnt += 1
	else:
		cnt += 2
print(cnt)


f = lambda : map(int, input().split())
(n, h) = f()
print(n + sum((q > h for q in f())))


h = int(input('').split(' ')[1])
ai = input('').split(' ')
ai = [int(i) for i in ai]
[ai.append(0) for a in ai if a > h]
print(len(ai))


import sys
from functools import reduce
from collections import Counter
import time
import datetime
from math import sqrt, gcd

def ip():
	return int(sys.stdin.readline())

def sip():
	return sys.stdin.readline()

def mip():
	return map(int, sys.stdin.readline().split())

def mips():
	return map(str, sys.stdin.readline().split())

def lip():
	return list(map(int, sys.stdin.readline().split()))

def matip(n, m):
	lst = []
	for i in range(n):
		arr = lip()
		lst.append(arr)
	return lst

def factors(n):
	return list(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))

def minJumps(arr, n):
	jumps = [0 for i in range(n)]
	if n == 0 or arr[0] == 0:
		return float('inf')
	jumps[0] = 0
	for i in range(1, n):
		jumps[i] = float('inf')
		for j in range(i):
			if i <= j + arr[j] and jumps[j] != float('inf'):
				jumps[i] = min(jumps[i], jumps[j] + 1)
				break
	return jumps[n - 1]

def dic(arr):
	return Counter(arr)

def check_prime(n):
	if n < 2:
		return False
	for i in range(2, int(n ** 0.5) + 1, 2):
		if n % i == 0:
			return False
	return True
(n, h) = mip()
lst = lip()
count = 0
for item in lst:
	if item > h:
		count += 2
	else:
		count += 1
print(count)


(num, height) = map(int, input().split())
c = list(map(int, input().split()))
f = 0
for item in c:
	if item > height:
		f += 1
print(num + f)


s = input().split()
h = int(s[1])
n = int(s[0])
s = input().split()
total = 0
for a in range(len(s)):
	if int(s[a]) > h:
		total += 2
	else:
		total += 1
print(total)


(n, h) = input().split(' ')
k = input().split(' ')
j = 0
for i in k:
	j += 1
	if int(i) > int(h):
		j += 1
print(j)


l = [int(x) for x in input().split()]
n = [int(x) for x in input().split()]
width = 0
for i in range(l[0]):
	if n[i] <= l[1]:
		width += 1
	else:
		width += 2
print(width)


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


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


(n, h) = list(map(int, input().split()))
nums = list(map(int, input().split()))
condition = lambda x: 1 if x <= h else 2
print(sum(map(condition, nums)))


(n, h) = map(int, input().split())
A = list(map(int, input().split()))
v = 0
for i in range(len(A)):
	if A[i] <= h:
		v += 1
	else:
		v += 2
print(v)


(a, b) = input().strip().split(' ')
(a, b) = [int(a), int(b)]
l = list(map(int, input().strip().split(' ')))
count = 0
for i in l:
	if i <= b:
		count = count + 1
	elif i > b:
		count = count + 2
print(count)


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
f = 0
for item in c:
	if item > b:
		f += 1
print(a + f)


def fun():
	(n, k) = map(int, input().split())
	l = list(map(int, input().split()))
	cnt = 0
	for i in l:
		if i > k:
			cnt += 2
		else:
			cnt += 1
	print(cnt)
fun()


(friends_number, fence_height) = map(int, input().split())
friend_height = list(map(int, input().split()))
total_width = 0
for j in range(int(friends_number)):
	if friend_height[j] <= fence_height:
		total_width += 1
	else:
		total_width += 2
min_width = total_width
print(min_width)


(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for x in a:
	if x > h:
		count += 1
print(len(a) + count)


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


def solve(arr, h):
	return sum([1 if a <= h else 2 for a in arr])

def main():
	(n, h) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	print(solve(arr, h))
main()


(n, h) = input().split()
friends = input().split()
res = 0
for f in friends:
	if int(f) <= int(h):
		res += 1
	else:
		res += 2
print(res)


from sys import stdin
(n, h) = map(int, stdin.readline().rstrip().split())
l = [int(x) for x in stdin.readline().rstrip().split()]
total = 0
for x in l:
	if x > h:
		total += 2
	else:
		total += 1
print(total)


sum = 0
inputs = input().split(' ')
for i in range(len(inputs)):
	inputs[i] = int(inputs[i])
heights = input().split(' ')
for i in range(len(heights)):
	heights[i] = int(heights[i])
for i in range(inputs[0]):
	if heights[i] <= inputs[1]:
		sum += 1
	else:
		sum += 2
print(sum)


nk = list(map(str, input().split()))
n = int(nk[0])
k = int(nk[1])
l = list(map(str, input().split()))
c = 0
for j in range(n):
	if int(l[j]) > k:
		c += 2
	else:
		c += 1
print(c)


import sys
from random import choice, randint
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def MI():
	return map(int, sys.stdin.readline().strip().split())

def LI():
	return list(map(int, sys.stdin.readline().strip().split()))

def LLI():
	return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().strip().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().strip().split()]

def LS():
	return sys.stdin.readline().strip().split()

def I():
	return int(sys.stdin.readline().strip())

def F():
	return float(sys.stdin.readline().strip())

def S():
	return sys.stdin.readline().strip()

def pf(s):
	return print(s, flush=True)

def pe(s):
	return print(str(s), file=sys.stderr)

def JA(a, sep):
	return sep.join(map(str, a))

def JAA(a, s, t):
	return s.join((t.join(map(str, b)) for b in a))
inp = sys.stdin.readline
out = sys.stdout.write

def main():
	(n, h) = MI()
	a = LI()
	c = 0
	for i in range(n):
		if a[i] > h:
			c += 2
		else:
			c += 1
	pf(c)
main()


w = 0
(n, h) = map(int, input().split())
for i in map(int, input().split()):
	w = [w + 1, w + 2][i > h]
print(w)


import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
sys.setrecursionlimit(100000000)
ii = lambda : int(input())
si = lambda : input()
jn = lambda x, l: x.join(map(str, l))
sl = lambda : list(map(str, input().strip()))
mi = lambda : map(int, input().split())
mif = lambda : map(float, input().split())
lii = lambda : list(map(int, input().split()))
ceil = lambda x: int(x) if x == int(x) else int(x) + 1
ceildiv = lambda x, d: x // d if x % d == 0 else x // d + 1
flush = lambda : stdout.flush()
stdstr = lambda : stdin.readline()
stdint = lambda : int(stdin.readline())
stdpr = lambda x: stdout.write(str(x))
mod = 1000000007
(n, h) = mi()
arr = lii()
w = 0
for ele in arr:
	if ele > h:
		w += 2
	else:
		w += 1
print(w)


(n, m) = map(int, input().split())
x = list(map(int, input().split(' ')))
c = 0
for i in x:
	if i > m:
		c += 2
	else:
		c += 1
print(c)


def read_int():
	return int(input())

def read_ints():
	return map(int, input().split(' '))
n = list(read_ints())
a = list(read_ints())
sum = 0
for i in range(n[0]):
	if a[i] > n[1]:
		sum += 2
	else:
		sum += 1
print(sum)


def solve(arr, w):
	count = 0
	for i in arr:
		if i > w:
			count += 2
		else:
			count += 1
	return count
(n, w) = list(map(int, input().split()))
arr = list(map(int, input().split()))
print(solve(arr, w))


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
s1 = [1 for i in range(n) if l[i] <= h]
s2 = [2 for i in range(n) if l[i] > h]
print(sum(s1) + sum(s2))


s = 0
p = input().rstrip().split(' ')
q = input().rstrip().split(' ')
for i in range(0, len(q)):
	if int(q[i]) <= int(p[1]):
		s = s + 1
	else:
		s = s + 2
print(s)


from sys import stdin, stdout
import math, bisect
from collections import Counter, deque, defaultdict
L = lambda : list(map(int, stdin.readline().strip().split()))
I = lambda : int(stdin.readline().strip())
S = lambda : stdin.readline().strip()
C = lambda : stdin.readline().strip().split()
M = lambda : map(int, stdin.readline().strip().split())

def pr(a):
	print(' '.join(list(map(str, a))))
import math
from collections import defaultdict as dd

def solve(a):
	ans = 0
	c = 0
	for i in range(len(a)):
		if a[i] == '*':
			break
	for j in range(i + 1, len(a)):
		if a[j] == '*':
			c = c + 1
			ans = ans + (j - (i + c))
	return ans
(n, k) = M()
l = L()
ans = 0
for i in l:
	if i > k:
		ans = ans + 2
	else:
		ans = ans + 1
print(ans)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
count = 0
for element in a:
	if element <= h:
		count += 1
	elif element > h:
		count += 2
print(count)


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


(n, h) = map(int, input().split(' '))
v = map(int, input().split(' '))
resp = 0
for i in v:
	if i > h:
		resp += 2
	else:
		resp += 1
print(resp)


(n, h) = map(int, input().split())
count = 0
arr = [int(x) for x in input().split()]
for x in arr:
	if x > h:
		count += 2
	else:
		count += 1
print(count)


def fence(h, ar):
	width = 0
	for i in ar:
		if i > h:
			width += 2
		else:
			width += 1
	print(width)
nh = list(map(int, input().rstrip().split()))
arr = list(map(int, input().rstrip().split()))
fence(nh[1], arr)


(n, h) = map(int, input().split())
list_height = list(map(int, input().split()))
counter_1 = 0
counter_2 = 0
for i in range(len(list_height)):
	if list_height[i] > h:
		counter_2 += 2
	else:
		counter_1 += 1
result = counter_1 + counter_2
print(result)


(n, h) = map(int, input().split())
while not 1 <= n <= 1000:
	n = int(input())
while not 1 <= h <= 1000:
	h = int(input())
a = [int(i) for i in input().split()]
while len(a) != n:
	a = [int(i) for i in input().split()]
for i in range(0, len(a)):
	while not 1 <= a[i] <= h * 2:
		a[i] = int(input())
s = 0
for j in a:
	if j > h:
		s += 2
	elif j <= h:
		s += 1
print(s)


a = list(map(int, input().split()))
cnt = 0
lst = list(map(int, input().split()))
for i in range(0, a[0]):
	if lst[i] > a[1]:
		cnt = cnt + 2
	else:
		cnt = cnt + 1
print(cnt)


x = input().split()
x0 = int(x[0])
x1 = int(x[1])
y = input().split()
width = 0
for x in range(x0):
	if int(y[x]) > x1:
		width = width + 2
	else:
		width = width + 1
print(width)


inp = input().split(' ')
width = int(inp[0])
h_fence = inp[1]
highs = input().split(' ')
for high in highs:
	if int(high) > int(h_fence):
		width += 1
print(width)


det = input().split(' ')
heights = input().split(' ')
width = 0
for i in range(int(det[0])):
	if int(heights[i]) <= int(det[1]):
		width += 1
	else:
		width += 2
print(width)


(f, h) = (int(x) for x in input().split())
answer = 0
therow = input().split()
for height in therow:
	if int(height) > h:
		answer += 2
	else:
		answer += 1
print(answer)


firstIn = str(input())
inSplit = firstIn.split()
numFriends = int(inSplit[0])
fenceHeight = int(inSplit[1])
heightIn = str(input())
heightSplit = heightIn.split()
heightList = []
for i in heightSplit:
	heightList.append(int(i))
width = 0
for i in heightList:
	if i > fenceHeight:
		width += 2
	else:
		width += 1
print(width)


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


num1 = list(map(int, input().split()))
num2 = list(map(int, input().split()))
a = 0
for i in range(num1[0]):
	if num2[i] > num1[1]:
		a += 2
	else:
		a += 1
print(a)


def zabor(lst, h):
	return len(lst) + len([elem for elem in lst if elem > h])
(N, H) = [int(i) for i in input().split()]
a = [int(j) for j in input().split()]
print(zabor(a, H))


in1 = input().split()
in1 = list(map(int, in1))
in2 = input().split()
in2 = list(map(int, in2))
n = in1[0]
h = in1[1]
w = 0
for i in range(n):
	if in2[i] <= h:
		w = w + 1
	else:
		w = w + 2
print(w)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
num = 0
for i in range(n):
	num += a[i] // h + int(a[i] % h != 0)
print(num)


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


import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *

class Scanner:

	@staticmethod
	def int():
		return int(sys.stdin.readline().rstrip())

	@staticmethod
	def string():
		return sys.stdin.readline().rstrip()

	@staticmethod
	def map_int():
		return [int(x) for x in Scanner.string().split()]

	@staticmethod
	def string_list(n):
		return [input() for i in range(n)]

	@staticmethod
	def int_list_list(n):
		return [Scanner.map_int() for i in range(n)]

	@staticmethod
	def int_cols_list(n):
		return [int(input()) for i in range(n)]

class Math:

	@staticmethod
	def gcd(a, b):
		if b == 0:
			return a
		return Math.gcd(b, a % b)

	@staticmethod
	def lcm(a, b):
		return a * b // Math.gcd(a, b)

	@staticmethod
	def divisor(n):
		res = []
		i = 1
		for i in range(1, int(n ** 0.5) + 1):
			if n % i == 0:
				res.append(i)
				if i != n // i:
					res.append(n // i)
		return res

	@staticmethod
	def round_up(a, b):
		return -(-a // b)

	@staticmethod
	def is_prime(n):
		if n < 2:
			return False
		if n == 2:
			return True
		if n % 2 == 0:
			return False
		d = int(n ** 0.5) + 1
		for i in range(3, d + 1, 2):
			if n % i == 0:
				return False
		return True

class PriorityQueue:

	def __init__(self, l=[]):
		self.q = l
		heapq.heapify(self.q)
		return

	def push(self, n):
		heapq.heappush(self.q, n)
		return

	def pop(self):
		return heapq.heappop(self.q)
MOD = int(1000000000.0) + 7
INF = int(1000000000000000.0)

def main():
	(N, H) = Scanner.map_int()
	A = Scanner.map_int()
	ans = 0
	for a in A:
		if a > H:
			ans += 2
		else:
			ans += 1
	print(ans)
main()


(person_num, wall_h) = map(int, input().split(' '))
line2 = input()
theLine2 = line2.split(' ')
width = 0
for x in theLine2:
	x = int(x)
	if x > wall_h:
		width += 2
	else:
		width += 1
print(width)


(num, height) = map(int, input().split())
width = 0
str1 = input()
str2 = str1.split()
for i in range(0, num):
	if int(str2[i]) > height:
		width = width + 2
	else:
		width = width + 1
print(width)


def program(length, max_height):
	height = length
	for i in person:
		if i > max_height:
			height += 1
	return height
n = list(map(int, input().strip().split()))
length = n[0]
max_height = n[1]
person = list(map(int, input().strip().split()))
print(program(length, max_height))


(n, t) = map(int, input().split())
print(n + sum((i > t for i in map(int, input().split()))))


def ans(arr):
	cnt = 0
	for i in range(n):
		if arr[i] > h:
			cnt += 2
		else:
			cnt += 1
	return cnt
nh = list(map(int, input().strip().split()))
(n, h) = (nh[0], nh[1])
a = list(map(int, input().strip().split()))
print(ans(a))


(n, h) = input().split(' ')
n = int(n)
h = int(h)
a_i = input().split(' ')
a_i = list(map(int, a_i))
result = 0
for i in range(n):
	if a_i[i] <= h:
		result += 1
	else:
		result += 2
print(result)


nh = list(map(int, input().split()))
w = 0
hieghts = list(map(int, input().split()))
for i in range(len(hieghts)):
	if hieghts[i] > nh[1]:
		w += 2
	else:
		w += 1
print(w)


(n, h) = [int(x) for x in input().split()]
k = [int(x) for x in input().split()]
print(n + sum((k[i] > h for i in range(n))))


n = input()
n_and_h = []
n_and_h = n.split()
width = 0
heights = []
temp = input()
heights = temp.split()
for i in range(0, int(n_and_h[0])):
	if int(heights[i]) > int(n_and_h[1]):
		width += 2
	else:
		width += 1
print(width)


(n, h) = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
hg = []
for i in range(0, n):
	if l[i] <= h:
		hg.append(1)
	elif l[i] >= h:
		hg.append(2)
print(sum(hg))


def main():
	(n, h) = [int(i) for i in input().split()]
	w = sum([(lambda x: 1 if x <= h else 2)(int(i)) for i in input().split()])
	print(w)
main()


from collections import deque
import math
(n, h) = map(int, input().split())
array = input().split()
for i in range(n):
	array[i] = int(array[i])
answer = 0
for i in range(n):
	if array[i] > h:
		answer += 2
	else:
		answer += 1
print(answer)


(a, b) = input().split(' ')
height = list(map(int, input().split()))
sum = 0
for i in range(int(a)):
	if height[i] <= int(b):
		sum = sum + 1
	elif height[i] > int(b) and height[i] <= 2 * int(b):
		sum = sum + 2
print(sum)


def calc_road_width(li, max_height):
	min_width = 0
	for height in li:
		if height > max_height:
			min_width = min_width + 2
		else:
			min_width = min_width + 1
	return min_width
(no_of_frnds, fence_height) = list(map(lambda x: int(x), input().split(' ')))
hgt_list = list(map(lambda y: int(y), input().split(' ')))
print(calc_road_width(hgt_list, fence_height))


(n, h) = input('').split()
n = int(n)
h = int(h)
height_s = input('').split()
heights = [int(i) for i in height_s]
count = 0
for j in heights:
	if j > h:
		count += 1
	else:
		continue
print(n + count)


A = input().split()
n = int(A[0])
h = int(A[1])
dr = list(map(int, input().split()))
j = 0
for elem in dr:
	if elem > h:
		j += 2
	else:
		j += 1
print(j)


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


friends_and_fence = list(map(int, input().split()))
tall = list(map(int, input().split()))
width = 0
for friend in range(friends_and_fence[0]):
	if tall[friend] <= friends_and_fence[1]:
		width += 1
	else:
		while tall[friend] > friends_and_fence[1]:
			tall[friend] = tall[friend] / 2
			width += 2
print(width)


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


str1 = input().split()
n = int(str1[0])
h = int(str1[1])
lst = input().split()
w = 0
for i in range(n):
	if int(lst[i]) % h:
		w = int(int(lst[i]) / h) + 1 + w
	else:
		w = int(int(lst[i]) / h) + w
print(w)


(x, y) = input().split()
x = int(x)
y = int(y)
arr = list(map(int, input().split()))
width = 0
for i in arr:
	if i > y:
		width += 2
	else:
		width += 1
print(width)


(n, h) = map(int, input().split())
d = [int(x) for x in input().split()]
(a, c) = (0, 0)
for i in d:
	if i > h:
		a += 1
		if i % h != 0:
			c += int(i / h) + 1
		else:
			c += int(i / h)
print(c + len(d) - a)


inp = list(map(int, input().strip().split()))
n = inp[0]
h = inp[1]
in_arr = list(map(int, input().strip().split()))
s = 0
for x in in_arr:
	if x > h:
		s += 2
	else:
		s += 1
print(s)


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


(n, h) = map(int, input().split(' '))
s = input().split(' ')
friends = []
for i in s:
	friends.append(int(i))
width = n
for i in friends:
	if i > h:
		width += 1
print(width)


(n, k) = map(int, input().split())
p = list(map(int, input().split()))
cnt1 = 0
cnt2 = 0
for i in range(n):
	if p[i] <= k:
		cnt1 = cnt1 + 1
	else:
		cnt2 = cnt2 + 2
cnt = cnt1 + cnt2
print(cnt)


def abir():
	return map(int, input().split(' '))
n = list(abir())
h = list(abir())
sum = 0
for i in range(n[0]):
	if h[i] > n[1]:
		sum += 2
	else:
		sum += 1
print(sum)


b = []
(n, m) = map(int, input().split(' '))
a = input().split(' ')
s = 0
for i in range(n):
	b.append(int(a[i]))
	if b[i] <= m:
		s = s + 1
	else:
		s = s + 2
print(s)


(num_friends, fence_height) = [int(x) for x in input().split()]
heights = [int(x) for x in input().split()]
count = 0
for height in heights:
	if height > fence_height:
		count += 2
	else:
		count += 1
print(count)


def getInts():
	return [int(s) for s in input().split()]

def getInt():
	return int(input())

def getStrs():
	return [s for s in input().split()]

def getStr():
	return input()

def listStr():
	return list(input())

def solve():
	(N, H) = getInts()
	A = getInts()
	return sum([1 for h in A if h <= H]) + sum([2 for h in A if h > H])
ans = solve()
print(ans)


(n, h) = map(int, input().split())
a = 0
k = 0
j = 0
arr = map(int, input().split())
for i in arr:
	if i == 2 and h == 1:
		j = 2
	else:
		while i > h:
			i = i / h
			j = j + 1
		else:
			k = k + 1
print(k + j)


[m, n] = map(int, input().split())
l = map(int, input().split())
j = 0
for i in l:
	if i <= n:
		j = j + 1
	else:
		j = j + 2
print(j)


def solution(n, h, listFrnd):
	result = 0
	for i in range(n):
		if listFrnd[i] < h or listFrnd[i] == h:
			result += 1
		elif listFrnd[i] > h:
			result += 2
	return result
(n, h) = map(int, input().split())
m = list(map(int, input().split()))
print(solution(n, h, m))


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
c = 0
c1 = 0
for i in l:
	if i <= h:
		c += 1
	else:
		c1 += 2
z = c + c1
print(z)


string = input()
string2 = string.split(' ')
n = int(string2[0])
h = int(string2[1])
string3 = input()
string4 = string3.split(' ')
ans = 0
for i in string4:
	if int(i) > h:
		ans += 2
	else:
		ans += 1
print(ans)


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


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


(a, b) = map(int, input().split())
c = list((int(x) for x in input().split() if int(x) > b))
print(a + len(c))


a = input()
b = input()
data = a.split()
fence_height = int(data[1])
friend_heights = b.split()
width_count = 0
for friend_height in friend_heights:
	if int(friend_height) > fence_height:
		width_count += 2
	else:
		width_count += 1
print(width_count)


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


(n, h) = map(int, input().split())
p_h = list(map(int, input().split()))
w = 0
for p in p_h:
	w += 1 if p <= h else 2
print(w)


n = str(input())
s = n.split(' ')
a = int(s[0])
b = int(s[1])
w = 0
nn = str(input())
ss = nn.split(' ')
g = int(len(ss))
for i in range(g):
	k = int(ss[i])
	if k > b:
		w += 2
	else:
		w += 1
print(w)


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


def vanyaAndFriends():
	n = input().split()
	values = input().split()
	sum = 0
	for i in values:
		if int(i) > int(n[1]):
			sum += 2
		else:
			sum += 1
	print(sum)
vanyaAndFriends()


import sys

def main():
	(friends, fence) = [int(x) for x in sys.stdin.readline().split()]
	width = 0
	for h in sys.stdin.readline().split():
		if int(h) > fence:
			width += 2
		else:
			width += 1
	print(width)
main()


def main():
	(a, b) = input().split()
	(a, b, c) = (int(a), int(b), 0)
	L = [int(x) for x in input().split()]
	for i in range(a):
		c += 1 if L[i] <= b else 2
	print(c)
main()


(n_count, h) = map(int, input().split())
n = list(map(int, input().split()))
shir = 0
for i in range(len(n)):
	if n[i] <= h:
		shir += 1
	else:
		shir += 2
print(shir)


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


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


import math
input_line = input()
input_line2 = input()
line1 = input_line.split()
n = int(line1[0])
h = int(line1[1])
line2 = input_line2.split()
sorted(line2)
answer = 0
A = 0
for i in range(0, n):
	A = int(line2[i])
	answer = answer + math.ceil(A / h)
print(answer)


(a, b) = map(int, input().split())
li = map(int, input().split())
res = 0
for each in li:
	if each > b:
		res = res + 2
	else:
		res = res + 1
print(res)


(people, f_height) = [int(x) for x in input().split(' ')]
p_heights = [int(x) for x in input().split(' ')]
tot = 0
for p in p_heights:
	if f_height // p == 0:
		tot += 2
	else:
		tot += 1
print(tot)


def Q31(h, lis):
	count = 0
	for i in lis:
		if i > h:
			count += 2
		else:
			count += 1
	return count
line1 = input().strip()
values1 = list(map(int, line1.split()))
line2 = input().strip()
values2 = list(map(int, line2.split()))
print(Q31(values1[1], values2))


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


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


(_, n) = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
t.sort()
c = 0
s = 0
for i in range(_):
	if t[i] <= n:
		c += 1
	else:
		s += 1
print(1 * c + s * 2)


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


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
width = 0
for i in a:
	if i % h == 0:
		width += i // h
	else:
		width += i // h + 1
print(width)


def main():
	(n, h) = map(int, input().split())
	a = list(map(int, input().split()))
	width = list()
	for i in a:
		width.append(2 if i > h else 1)
	print(sum(width))
main()


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
(n, h) = invr()
s = inlt()
r = 0
for i in s:
	if i > h:
		r += 1
print(n + r)


(n, h) = map(int, input().split())
s = input().split()
wi = 0
for elem in s:
	if int(elem) > h:
		wi += 2
	else:
		wi += 1
print(wi)


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


import sys
import math
import bisect

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


(f, h) = map(int, input().split())
arr = len(list(filter(lambda x: int(x) > h, input().split())))
print(arr * 2 + (f - arr))


nh = list(map(int, input().split()))
s = list(map(int, input().split()))
width = 0
for i in s:
	width += 1
	if i > nh[1]:
		width += 1
print(width)


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


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


n = list(map(int, input().split()))
m = list(map(int, input().split()))
sum = 0
for _ in range(len(m)):
	if m[_] > n[1]:
		sum += 2
	else:
		sum += 1
print(sum)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
answer = 0
for e in l:
	if e > h:
		answer += 2
	else:
		answer += 1
print(answer)


(n, m) = map(int, input().split())
l = [int(x) for x in input().split()]
d = []
for i in l:
	if i <= m:
		d.append(1)
	else:
		d.append(2)
print(sum(d))


x = input()
x = x.split(' ')
n = int(x[0])
h = int(x[1])
wzrosty = input()
wzrosty = wzrosty.split(' ')
wynik = 0
for i in wzrosty:
	if int(i) <= h:
		wynik += 1
	else:
		wynik += 2
print(wynik)


(n, h) = map(int, input().split())
arr = [int(i) for i in input().split()][:n]
c = 0
for i in arr:
	if i <= h:
		c += 1
	else:
		c += 2
print(c)


import math
(m, n) = map(int, input().split())
list_ = list(map(int, input().split()))
sum_ = 0
for i in list_:
	if i > n:
		sum_ += math.ceil(i / n)
	else:
		sum_ += 1
print(sum_)


w = input().split()
n = w[0]
h = w[1]
s = input().split()
cont = 0
for i in s:
	if int(i) > int(h):
		cont += 1
print(int(n) + cont)


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


(n, h) = [int(i) for i in input().split(' ')]
m = [int(i) for i in input().split(' ')]
a = n
for i in m:
	if i > h:
		a += 1
print(a)


l = input()
(n, h) = l.split()
n = int(n)
h = int(h)
p = input()
an = p.split()
wid = 0
for i in range(n):
	if eval(an[i]) > h:
		wid += 2
	else:
		wid += 1
print(wid)


i1 = input('').split(' ')
n = int(i1[0])
h = int(i1[1])
i2 = input('').split(' ')
counter = 0
myList = []
while counter < n:
	if int(i2[counter]) > h:
		myList.append(2)
	else:
		myList.append(1)
	counter = counter + 1
x = sum(myList)
print(str(x))


(n, h) = tuple([int(element) for element in input().split(' ')])
friends = [int(element) - h for element in input().split(' ')]
friends = [1 if element <= 0 else 2 for element in friends]
print(sum(friends))


(n, h) = list(map(int, input().split()))
ar = list(map(int, input().split()))
w = 0
for i in ar:
	if i <= h:
		w += 1
	else:
		w += 3 - 1
print(w)


(x, y) = input().split()
(number_of_friends, height) = (int(x), int(y))
friends = list(map(int, input().split()))
(times, minmum_width_of_road) = (0, 0)
for friend in friends:
	if friend > height:
		width = 2
	else:
		width = 1
	minmum_width_of_road = minmum_width_of_road + width
print(minmum_width_of_road)


first = list(map(int, input().strip().split()))
n = first[0]
h = first[1]
del first
heights = list(map(int, input().strip().split()))
min_wid = 0
for hiegth in heights:
	if hiegth > h:
		min_wid += 2
	else:
		min_wid += 1
print(min_wid)


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


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


import sys

def rl():
	return sys.stdin.readline().strip()

def rn():
	return list(map(int, sys.stdin.readline().strip().split()))

def ri():
	return map(int, sys.stdin.readline().strip().split())

def rln(n):
	l = [None] * n
	for i in range(n):
		l[i] = int(rl())
	return l
(n, h) = map(int, input().split())
tab = rn()
cnt = 0
for e in tab:
	if e <= h:
		cnt += 1
	else:
		cnt += 2
print(cnt)


line = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
for x in a:
	if x <= line[1]:
		ans += 1
	else:
		ans += 2
print(ans)


(x, y) = input().split(' ')
a = (x, y)
a = list(a)
for i in range(len(a)):
	a[i] = int(a[i])
s = a[1]
arr = list(map(int, input().split()[:a[0]]))
count = 0
for i in range(len(arr)):
	if arr[i] > s:
		count += 2
	else:
		count += 1
print(count)


def get_values():
	(n, h) = list(map(int, input().split()))
	heights = list(map(int, input().split()))
	counter = 0
	for i in heights:
		if i > h:
			counter += 2
		else:
			counter += 1
	return print(counter)
get_values()


(n, h) = list(map(int, input().split()))
a = list(map(int, input().split()))
width = 0
for x in range(n):
	if a[x] > h:
		width = width + 2
	elif a[x] <= h:
		width = width + 1
print(width)


(n, h) = map(int, input().split())
gt = len(list(filter(lambda x: x > h, map(int, input().split()))))
print(2 * gt + n - gt)


h = int(input().split(' ')[1])
List = input().split(' ')
road_length = 0
for height in List:
	if int(height) <= h:
		road_length += 1
	else:
		road_length += 2
print(road_length)


r = 0
it = 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
while it < a[0]:
	if b[it] <= a[1]:
		r += 1
	else:
		r += 2
	it += 1
print(r)


a = input()
nh = a.split(' ')
b = input()
friendHt = b.split()
i = int(nh[0])
for friend in friendHt:
	if int(friend) > int(nh[1]):
		i += 1
print(i)


(numPeople, heightFences) = input().split()
numPeople = int(numPeople)
heightFences = int(heightFences)
heightPeople = input()
listofHeightPeople = heightPeople.split(' ')
count = 0
for i in range(len(listofHeightPeople)):
	if int(listofHeightPeople[i]) > heightFences:
		count = count + 2
	else:
		count = count + 1
print(count)


(n, h) = input().split()
h = int(h)
c = 0
for i in input().split():
	c = c + int(int(i) > h) * 2 + int(int(i) <= h)
print(c)


from sys import stdin

def min_width(a, h):
	return sum((2 if x > h else 1 for x in a))
lines = stdin.readlines()
h = int(lines[0].split()[1])
a = map(int, lines[1].split())
print(min_width(a, h))


(n, m) = map(int, input().split())
n1 = list(map(int, input().split()))
width = 0
for i in n1:
	if i > m:
		width = width + 2
	else:
		width = width + 1
print(width)


l = input().split()
n = int(l[0])
h = int(l[1])
width = 0
a = input().split()
for i in range(n):
	if int(a[i]) <= h:
		width += 1
	if int(a[i]) > h:
		width += 2
print(width)


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


x = input().split()
y = input().split()
counter = 0
for i in range(int(x[0])):
	if int(y[i]) > int(x[1]):
		counter += 2
	else:
		counter += 1
print(counter)


(n, h) = input().split(' ')
(n, h) = (int(n), int(h))
a = input().split()[:n]
width = 0
for item in a:
	if int(item) <= h:
		width += 1
	else:
		width += 2
print(width)


(n, h) = map(int, input().split())
ppl = list(map(int, input().split()))
width = 0
for l in ppl:
	if l <= h:
		width += 1
	else:
		width += 2
print(width)


import functools
(n, h) = map(int, input().split())
_as = map(int, input().split())
w = functools.reduce(lambda w, a: w + (2 if a > h else 1), _as, 0)
print(w)


def main():
	from sys import stdin, stdout
	from math import ceil
	(n, k) = map(int, stdin.readline().split())
	a = list(map(int, stdin.readline().split()))
	ksum = 0
	for i in a:
		x = ceil(i / k)
		if x > 2:
			x = 2
		ksum += x
	stdout.write(str(ksum))
main()


barrier = [int(x) for x in input().split()]
friend = [int(y) for y in input().split()]
print(len(friend) + sum((friend[i] > barrier[1] for i in range(barrier[0]))))


(a, b) = [int(x) for x in input().split()]
c = [int(x) for x in input().split()]
s = 0
for i in c:
	if i <= b:
		s += 1
	elif i > b:
		s += 2
print(s)


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


(n, h) = [int(x) for x in input().split()]
lt = [int(x) for x in input().split()]
wide = n
for i in range(n):
	if lt[i] > h:
		wide += 1
print(wide)


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


input_str = input()
line1 = input_str.split()
n = int(line1[0])
h = int(line1[1])
cnt = 0
input_str = input()
heights = input_str.split()
for i in heights:
	a = int(i)
	if a <= h:
		cnt = cnt + 1
	else:
		cnt = cnt + 2
print(cnt)


nh = input().split()
n = int(nh[0])
h = int(nh[1])
row = input().split()
width = 0
for i in row:
	if int(i) <= h:
		width += 1
	else:
		width += 2
print(width)


(a, b) = map(int, input().split())
d = 0
c = list(map(int, input().split()))
for j in range(a):
	if c[j] > b:
		d += 2
	else:
		d += 1
print(d)


import math
(n, m) = map(int, input().split())
s = [*map(int, input().split())]
print(sum((math.ceil(s[i] / m) for i in range(n))))


(a, b) = map(int, input().split())
wir = 0
for k in map(int, input().split()):
	if b >= k:
		wir += 1
	elif b < k:
		wir += 2
print(wir)


(N, H) = list(map(int, input().split()))
print(sum(list(map(lambda x: 1 if int(x) <= H else 2, input().split()))))


n = input()
a = n.split()
p = int(a[0])
h = int(a[1])
width = 0
hs = input()
b = hs.split()
for i in range(0, p):
	b[i] = int(b[i])
	if b[i] > h:
		width = width + 2
	else:
		width = width + 1
print(width)


def height():
	(n, h) = list(map(int, input().split()))
	a = []
	s = 0
	s2 = 0
	a = list(map(int, input().strip().split()))[:n]
	for j in range(len(a)):
		if a[j] <= h:
			s = s + 1
		elif a[j] > h:
			s2 += 2
	t = 0
	t = s + s2
	print(t)
y = height()


(n, m) = map(int, input().split())
l = [int(x) for x in input().split()]
l1 = [x for x in l if x > m]
print(len(l) + len(l1))


def Possible_width(line1, line2):
	first_line = [int(i) for i in line_1.split()]
	second_line = [int(i) for i in line_2.split()]
	width = 0
	for person in second_line:
		if person <= first_line[1]:
			width += 1
		else:
			width += 2
	return width
line_1 = input()
line_2 = input()
print(Possible_width(line_1, line_2))


(n, h) = [int(e) for e in input().split()]
s = [int(e) for e in input().split()]
min_wight = 0
for e in s:
	if e > h:
		min_wight += 2
	else:
		min_wight += 1
print(min_wight)


l = list(map(int, input().split()))
li = list(map(int, input().split()))
friends = l[0]
fance = l[1]
width = 0
for i in range(friends):
	if li[i] > fance:
		width += 2
	else:
		width += 1
print(width)


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


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


(number, height) = input().split()
friends = input().split(' ')
width = 0
for i in range(0, int(number)):
	if int(friends[i]) > int(height):
		width += 2
	else:
		width += 1
print(width)


a = list(map(int, input().split()))
h = a[1]
a = list(map(int, input().split()))
s = 0
for el in a:
	if el <= h:
		s += 1
	else:
		s += 2
print(s)


import sys, os.path
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
sys.setrecursionlimit(10 ** 5)

def i():
	return sys.stdin.readline().strip()

def ii():
	return int(sys.stdin.readline())

def li():
	return list(sys.stdin.readline().strip())

def mii():
	return map(int, sys.stdin.readline().split())

def lii():
	return list(map(int, sys.stdin.readline().strip().split()))

def solve():
	(a, b) = mii()
	c = lii()
	d = []
	[d.append(x) for x in c if x > b]
	print(a + len(d))
solve()


import math
(a, b) = map(int, input().split())
l = list(map(int, input().split()))
s = 0
for i in l:
	if i <= b:
		s = s + 1
	else:
		s = s + 2
print(s)


x = list(input().split())
y = list(input().split())
c = 0
if len(y) == int(x[0]):
	for i in y:
		if int(i) > int(x[1]):
			c += 2
		else:
			c += 1
print(c)


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


(n, m) = list(map(int, input().split()))
a = list(map(int, input().split()))
print(len(list(filter(lambda x: x > m, a))) * 2 + len(list(filter(lambda x: x <= m, a))))


arr = input().split()
n = int(arr[0])
x = int(arr[1])
m = input().split()
i = 0
c = 0
while i < n:
	if int(m[i]) > x:
		c = c + 2
	else:
		c += 1
	i += 1
print(c)


(inp, frnds, c) = (input().split(), input().split(), 0)
for i in range(int(inp[0])):
	if int(frnds[i]) > int(inp[1]):
		c += 2
	else:
		c += 1
print(c)


f = [int(x) for x in input().split()]
g = [int(x) for x in input().split()]
x = 0
for i in g:
	if i > f[1]:
		x += 2
	else:
		x += 1
print(x)


(n, h) = [int(x) for x in input().split(' ')]
people = [int(x) for x in input().split(' ')]
min_width = 0
for person in people:
	if person > h:
		min_width += 2
	else:
		min_width += 1
print(min_width)


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


def VanyaAndFence():
	(n, h) = map(int, input().split())
	row = list(map(int, input().split()))
	t_width = 0
	for i in range(n):
		if row[i] <= h:
			t_width += 1
		else:
			t_width += 2
	print(t_width)

def main():
	VanyaAndFence()
main()


w = 0
fh = int(input().split()[-1])
personsH = input().split()
for p in personsH:
	if int(p) > fh:
		w += 2
	else:
		w += 1
print(w)


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


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


s = input().split(' ')
peop = input().split(' ')
x = 0
for i in peop:
	if int(i) > int(s[1]):
		x += 2
	else:
		x += 1
print(x)


varis = input()
varis = varis.split()
num = int(varis[0])
limit = int(varis[1])
choices = input()
choices = choices.split()
result = 0
for choice in choices:
	if int(choice) > limit:
		result += 2
	else:
		result += 1
print(result)


(number_of_people, fence_height) = [int(x) for x in input().split(' ')]
people = [int(x) for x in input().split(' ')]
counter = 0
for x in people:
	if x > fence_height:
		counter += 1
width = number_of_people - counter + counter * 2
print(width)


a = list()
b = list()
a = input().split()
b = input().split()
c = 0
for i in b:
	if int(i) > int(a[1]):
		c += 1
	c += 1
print(c)


y = input().split(' ')
z = input().split(' ')
w = 0
for i in range(int(y[0])):
	if int(z[i]) <= int(y[1]):
		w += 1
	else:
		w = w + 2
print('\n', w)


inp = input().split()
n = int(inp[0])
h = int(inp[1])
dor = 0
hei = list(input().split())
for i in range(n):
	if int(hei[i]) > h:
		dor += 2
	else:
		dor += 1
print(dor)


q = [int(x) for x in input().split()]
(n, h) = (q[0], q[1])
b = []
a = [int(x) for x in input().split()]
for i in range(n):
	if a[i] <= h:
		b.append(1)
	else:
		b.append(2)
print(sum(b))


nh = tuple(map(int, input().split()))
arr = tuple(map(int, input().split()))
ans = 0
for i in range(nh[0]):
	ans += 1
	if arr[i] > nh[1]:
		ans += 1
print(ans)


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


h = int(input().split(' ')[1])
friends = [int(x) for x in input().split(' ')]
state = {}
for i in range(len(friends)):
	if friends[i] > h:
		state[i] = 2
	else:
		state[i] = 1
print(sum(list(state.values())))


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
print(len(l) + len([x for x in l if x > h]))


(i, n) = map(int, input().split())
l = list(map(int, input().split()))
word = i
for ele in l:
	if ele > n:
		word += 1
print(word)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
w = 0
m = list()
for i in range(n):
	if a[i] <= h:
		w = w + 1
	else:
		w = w + 2
	m.append(i)
print(w)


num_height = input().split()
num_height = [int(i) for i in num_height]
height = input().split()
height = [int(i) for i in height]
count = num_height[0]
for element in height:
	if element > num_height[1]:
		count += 1
print(count)


(a, b) = [int(i) for i in input().split(' ')]
c = [int(i) for i in input().split()]
d = 0
for i in c:
	if i > b:
		c.remove(c[d])
		c.insert(d, 2)
	else:
		c.remove(c[d])
		c.insert(d, 1)
	d += 1
print(sum(c))


n = input()
lst = n.split()
height = int(lst[1])
all = input()
spl = map(int, all.split())
main = list(spl)
ans = 0
for i in main:
	if i < height or i == height:
		ans += 1
	elif i > height:
		ans += 2
print(ans)


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)


fl = input().split(' ')
ppl_c = int(fl[0])
fh = int(fl[1])

def get_person_width(fh, ph):
	return 1 if fh >= ph else 2
m = 0
for ph in [int(x) for x in input().split(' ')]:
	m = m + get_person_width(fh, ph)
print(m)


(n, h) = input().split()
n = int(n)
h = int(h)
a = list(input().split())
for i in range(0, len(a)):
	a[i] = int(a[i])
width = 0
for i in range(0, len(a)):
	if a[i] <= h:
		width += 1
	elif h < a[i]:
		width += 2
print(width)


(nums, height) = input().split(' ')
friends = input().split(' ')
lenght = 0
for i in range(len(friends)):
	if int(friends[i]) > int(height):
		lenght += 2
	else:
		lenght += 1
print(lenght)


(n, h) = [int(i) for i in input().split()]
hs = [int(i) for i in input().split()]
res = 0
for i in range(n):
	if hs[i] > h:
		res += 1
print(n + res)


first_input = [int(x) for x in input().split(' ')]
second_input = [int(y) for y in input().split(' ')]
a = first_input[0]
b = first_input[1]

def length_row(a, b):
	d = 0
	for item in second_input:
		if int(item) > int(b):
			d += 2
		else:
			d += 1
	print(d)
length_row(a, b)


(n, h) = map(int, input().split(' '))
friends = input().split(' ')
li = [int(a) for a in friends]

def fence(value):
	value = value
	width = 0
	if value > h:
		width += 2
	else:
		width += 1
	return width
l = list(map(fence, li))
print(sum(l))


(a, b) = map(int, input().split())
m = 0
n = 0
k = list(map(int, input().split()))
for x in k:
	if x <= b:
		m += 1
	else:
		n += 2
s = m + n
print(s)


m = list(map(int, input().split()))
n = list(map(int, input().split()))
a = m[0]
b = m[1]
k = 0
for i in range(a):
	x = n[i]
	if x > b:
		k += 1
print(a + k)


(n, m) = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
c = 0
for i in arr:
	if i > m:
		c = c + 2
	else:
		c += 1
print(c)


nh = input().split()
(n, h) = (int(nh[0]), int(nh[1]))
inps = input().split()
w = 0
for i in range(n):
	cur = int(inps[i])
	if cur > h:
		w += 2
	else:
		w += 1
print(w)


(n, h) = map(int, input().split(' '))
width = sum((2 if e > h else 1 for e in map(int, input().split(' '))))
print(width)


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


import sys
(n, h) = map(int, sys.stdin.readline().split())
an = list(map(int, sys.stdin.readline().split()))
result = 0
for a in an:
	if a > h:
		result += 2
	else:
		result += 1
print(result)


ans = 0
(n, m) = map(int, input().split())
input_list = list(map(int, input().split()))
for i in input_list:
	if i > m:
		ans += 2
	else:
		ans += 1
print(ans)


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

def solution(no_friends, max_height, Heights):
	count = 0
	if no_friends >= 1:
		for i in range(no_friends):
			count += 1
			if Heights[i] > max_height:
				count += 1
		return count
print(solution(n, h, heights))


(n, h) = [int(x) for x in input().split()]
heights = [int(x) for x in input().split()]
min = n
for i in range(n):
	if heights[i] > h:
		min += 1
print(min)


(n, h) = input().split(' ')
heights = input().split(' ')
width = int(n)
for height in heights:
	if int(height) > int(h):
		width += 1
print(width)


(n, height) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
add = 0
for i in a:
	if i > height:
		add += 2
	else:
		add += 1
print(add)


lin1 = input().split()
h = input().split()
for i in range(len(h)):
	h[i] = int(h[i])
n_friends = int(lin1[0])
h_fence = int(lin1[1])
total = 0
for i in h:
	if i > h_fence:
		total += 2
	else:
		total += 1
print(total)


(n, h) = map(int, input().split())
heights = [int(i) for i in input().split()]
i = 0
c = 0
while i < len(heights):
	if heights[i] > h:
		c += 2
	elif heights[i] <= h:
		c += 1
	i += 1
print(c)


inp1 = list(map(int, input().rstrip().split()))
inp2 = list(map(int, input().rstrip().split()))
lst = []
for i in inp2:
	if i > inp1[1]:
		lst.append(2)
	else:
		lst.append(1)
print(sum(lst))


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


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
l.sort(reverse=True)
p = 0
for i in range(len(l)):
	if l[i] > k:
		p = p + 1
	else:
		break
print(n - p + p * 2)


q = input()
(n, z) = q.split()
n = int(n)
z = int(z)
a = list(map(int, input().split()))
s = 0
for i in range(len(a)):
	if a[i] > z:
		s += 2
	else:
		s += 1
print(s)


(n, h) = map(int, input().split())
lst = list(map(int, input().split()))
count = 0
for item in lst:
	if item <= h:
		count = count + 1
	else:
		count = count + 2
print(count)


(n, h) = list(map(int, input().split()))
arr = list(map(int, input().split()))
sum = 0
for elm in arr:
	if elm > h:
		sum += 2
	else:
		sum += 1
print(sum)


import sys

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def width(n, h, phs):
	w = 0
	for p in phs:
		if p > h:
			w += 2
		else:
			w += 1
	return w
(n, h) = tuple(get_ints())
phs = list(get_ints())
print(width(n, h, phs))


x = input()
y = input()
answer = 0
N = x.split()
a = y.split()
for i in range(0, int(N[0])):
	if int(a[i]) > int(N[1]):
		answer += 2
	else:
		answer += 1
print(answer)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
p = []
for i in l:
	if i > h:
		c = 2
		p.append(c)
	else:
		k = 1
		p.append(k)
print(sum(p))


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


def solve():
	(n, h) = map(int, input().split())
	heights = [int(i) for i in input().strip().split() if int(i) > h]
	print(n - len(heights) + len(heights) * 2)
solve()


(p, q) = map(int, input().split())
lst = list(map(int, input().split()))
t = 0
for i in lst:
	if i > q:
		t += 1
print(p + t)


(n, k) = map(int, input().split())
my_list = list(map(int, input().split()))
counter = 0
for i in my_list:
	counter += 1
	if i > k:
		counter += 1
print(counter)


(n, l) = [int(x) for x in input().split()]
r = 0
k = [int(x) for x in input().split()]
for i in range(len(k)):
	if k[i] > l:
		r += 2
	else:
		r += 1
print(r)


firstLine = input().split()
numDeFriends = firstLine[0]
height = int(firstLine[1])
friends = input().split()
summer = 0
for friend in friends:
	if int(friend) > height:
		summer = summer + 2
	else:
		summer = summer + 1
print(summer)


def solve():
	return sum([1 if x <= h else 2 for x in a])
(n, h) = map(int, input().strip().split())
a = list(map(int, input().strip().split()))
print(solve())


(_, h) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
w = 0
for e in l:
	if e > h:
		w += 2
	else:
		w += 1
print(w)


(n, h) = map(int, input().split())
h_of_prsns = list(map(int, input().split()))
width_of_road = 0
for i in h_of_prsns:
	if i <= h:
		width_of_road += 1
	else:
		width_of_road += 2
print(width_of_road)


count = 0
(A, B) = map(int, input().split())
C = list(input().split())
for i in C:
	if int(i) > B:
		count += 2
	elif int(i) <= B:
		count += 1
print(count)


(a, b) = [int(x) for x in input().split()]
s = [int(j) for j in input().split()]
l = 0
for i in range(a):
	if s[i] <= b:
		l += 1
	else:
		l += 2
print(l)


(N, H) = [int(d) for d in input().split(' ')]
t = [int(d) for d in input().split(' ')]
contador = 0
for i in t:
	if i <= H:
		contador += 1
	else:
		contador += 2
print(contador)


(n, h) = map(int, input().split())
heights = list(map(int, input().split()))
g = 0
for height in heights:
	if height > h:
		g += 1
print(g * 2 + (len(heights) - g))


(a, b) = input().split(' ')
arr = list()
arr = input().split(' ')
a = int(a)
b = int(b)
i = 0
k = 0
while a > 0:
	if int(arr[i]) <= b:
		k += 1
	else:
		k += 2
	a -= 1
	i += 1
print(k)


import sys
(n, fence) = map(int, sys.stdin.readline().split())
ami = input()
ami = ami.split(' ')
ami = [int(i) for i in ami]
for i in ami:
	if i > fence:
		n += 1
print(n)


(n, m) = map(int, input().split())
s = list(map(int, input().split()))
l = []
for i in s:
	count = 0
	if i > m:
		count += 1
		l.append(count)
a = sum(l)
print(n + a)


cnt = 0
(x, y) = input().split(' ')
x = int(x)
y = int(y)
arr = sorted([int(i) for i in input().split() if i.isdigit()])
for i in range(x):
	if arr[i] <= y:
		cnt = cnt + 1
	else:
		cnt = cnt + 2
print(cnt)


try:
	(n, h) = input().split()
	n = int(n)
	h = int(h)
	l = [int(ele) for ele in input().split()]
	width = 0
	for e in l:
		if e > h:
			width += 2
		else:
			width += 1
	print(width)
except Exception:
	pass


s = input()
l = s.split(' ')
n = int(l[0])
h = int(l[1])
s1 = input()
l1 = s1.split(' ')
w = 0
for i in l1:
	i = int(i)
	if i > h:
		w = w + 2
	else:
		w = w + 1
print(w)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
print(sum((i <= h for i in l)) + 2 * sum((i > h for i in l)))


(n, h) = [int(n) for n in input().split()]
s = list(map(int, input('').split()))[:n]
usualwalk = 0
bentwalk = 0
for i in s:
	if i > h:
		bentwalk += 2
	elif i <= h:
		usualwalk += 1
print(usualwalk + bentwalk)


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


a = input().split()
s = input().split()
res = 0
for i in s:
	if int(a[1]) < int(i):
		res = res + 2
	else:
		res = res + 1
print(res)


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


(n, m) = [int(i) for i in input().split(' ')]
arr = [int(i) for i in input().split(' ')]
ans = 0
for i in arr:
	if i > m:
		ans += 1
print(ans + n)


(friends_cnt, fence_height) = map(int, input().split())
friends_height = map(int, input().split())
min_width = 0
for friend_height in friends_height:
	if friend_height > fence_height:
		min_width += 2
	else:
		min_width += 1
print(min_width)


(n, h) = map(int, input().split(' '))
a = map(int, input().split(' '))
t = 0
for i in a:
	if i > h:
		t += 1
print(n + t)


(n, h) = list(map(int, input().split()))
friends_heigh = list(map(int, input().split()))
times = 0
for heigh in friends_heigh:
	if heigh > h:
		times += 2
	else:
		times += 1
print(times)


from collections import deque
from heapq import heappush, heappop
import re

def int_raw():
	return int(input())

def ss_raw():
	return input().split()

def ints_raw():
	return list(map(int, ss_raw()))
INF = 1 << 29
(N, H) = ints_raw()
As = ints_raw()

def main():
	return sum([1 if a <= H else 2 for a in As])
print(main())


def read_int():
	return int(input().strip())

def read_ints():
	return list(map(int, input().strip().split(' ')))

def solve():
	(n, h) = read_ints()
	A = read_ints()
	return sum((1 if a <= h else 2 for a in A))
print(solve())


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


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


(n, h) = map(int, input().split())
(*s,) = map(int, input().split())
a = 0
for i in s:
	if i > h:
		a += 1
print(len(s) + a)


(n, h) = list(map(int, input().split(' ')))
heights = list(map(int, input().split(' ')))
widths = [1] * n
i = 0
while i < len(heights):
	if heights[i] > h:
		widths[i] = 2
	i += 1
print(sum(widths))


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
print(sum((x <= k for x in a)) + sum((2 for x in a if x > k)))


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


i = input
(a, b) = map(int, i().split())
print(sum(((y > b) + 1 for y in list(map(int, i().split())))))


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


from functools import reduce
(n, h) = [int(x) for x in input().split()]
ns = [int(x) for x in input().split()]
print(reduce(lambda acc, num: 2 + acc if num > h else 1 + acc, ns, 0))


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


import sys
(n, h) = map(int, sys.stdin.readline().split())
s = 0
a = list(map(int, input().split(' ')))
for x in a:
	s += 1 if x <= h else 2
print(s)


(number, height) = map(int, input().split())
data = list(map(int, input().split()))
result = 0
for m in data:
	if m > height:
		result += 2
	else:
		result += 1
print(result)


(n, t) = map(int, input().split(' '))
m = list(map(int, input().split(' ')))
count = 0
for i in range(len(m)):
	if m[i] <= t:
		count += 1
	else:
		count += 2
print(count)


(n, h) = map(int, input().split())
lst = list(map(int, input().split()))
count = n
for i in lst:
	if i > h:
		count += 1
print(count, end=' ')


import sys
width = 0
n = 0
for l in sys.stdin:
	if n == 0:
		for k in l.split():
			if n == 0:
				people = int(k)
				n = n + 1
			else:
				height = int(k)
		continue
	for k in l.split():
		if k != ' ':
			if int(k) > height:
				width = width + 2
			else:
				width = width + 1
	break
print(width)


(n, h) = (int(x) for x in input().split())
heights = [int(x) for x in input().split()]
h_plus = 0
h_minus = 0
for height in heights:
	if height > h:
		h_plus += 1
	else:
		h_minus += 1
width = h_plus * 2 + h_minus
print(width)


(n, h) = map(int, input().split(' '))
a = map(int, input().split(' '))
l = 0
for x in a:
	l += x > h
print(l + n)


(n, h) = [int(n) for n in input().split()]
array = [int(x) for x in input().split()]
count = 0
for i in range(n):
	if array[i] > h:
		count = count + 2
	else:
		count = count + 1
print(count)


def width(l, h):
	w = 0
	for x in l:
		if x > h:
			w += 2
		else:
			w += 1
	return w
(n, h) = tuple(map(int, input().split()))
l = list(map(int, input().split()))
print(width(l, h))


import sys

def geti():
	return map(int, sys.stdin.readline().strip().split())

def getli():
	return list(map(int, sys.stdin.readline().strip().split()))
(n, h) = geti()
A = getli()
c = 0
for i in A:
	if i <= h:
		c += 1
	else:
		c += 2
print(c)


def bent(fence, n_list):
	count = 0
	for x in n_list:
		if x > fence:
			count += 2
		else:
			count += 1
	return count
(num, fence) = map(int, input().split())
n_list = list(map(int, input().split()))
print(bent(fence, n_list))


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


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
a = [i for i in l if i > h]
print(n + len(a))


(n, h) = map(int, input().split())
A = list(map(int, input().split()))
i = 0
j = 0
while i < n:
	if A[i] > h:
		j = j + 1
	else:
		pass
	i = i + 1
print(n + j)


(a, b) = input().split()
b = int(b)
p = []
m = list(map(int, input().split()))
for i in m:
	if i <= b:
		p.append(1)
	else:
		p.append(2)
print(sum(p))


x = input()
numebers = x.split()
height = int(numebers[1])
y = input()
people = y.split()
people = list(map(int, people))
a = 0
for z in people:
	if z > height:
		a = a + 2
	else:
		a = a + 1
print(a)


x = input()
x = list(map(int, x.strip().split()))
y = input()
y = list(map(int, y.strip().split()))
sum = 0
for i in range(len(y)):
	if y[i] > x[1]:
		sum = sum + 2
	else:
		sum = sum + 1
print(sum)


(m, n) = map(int, input().split())
(lst, l) = ([], [])
(a, b, c) = (0, 0, 0)
for (i, j) in enumerate(map(int, input().split())):
	if j > n:
		a += 2
	else:
		b += 1
print(a + b)


(n, m) = map(int, input().split())
L = list(map(int, input().split()))
Ans = 0
for i in range(n):
	if L[i] <= m:
		Ans += 1
	else:
		Ans += 2
print(Ans)


(n, h) = input().split()
n = int(n)
h = int(h)
li = [int(x) for x in input().split()]
sum = 0
for i in range(0, len(li)):
	if li[i] > h:
		sum = sum + 2
	else:
		sum = sum + 1
print(sum)


(n, h) = [int(x) for x in input().split(' ')]
friends = [int(x) for x in input().split(' ')]
for f in friends:
	if f > h:
		n += 1
print(n)


(n, h) = map(int, input().split(' '))
aline = input().split(' ')
a = [int(i) for i in aline]
output = 0
for i in a:
	if i <= h:
		output += 1
	else:
		output += 2
print(output)


(p, f) = map(int, input().split())
arr = list(map(int, input().split()))
count = 0
for i in range(p):
	if arr[i] <= f:
		count += 1
	else:
		count += 2
print(count)


from functools import reduce
(number_of_friends, height_of_fence) = map(int, input().split())
firends_height = list(map(int, input().split()))
above_height = list(filter(lambda el: el > height_of_fence, firends_height))
above_height_len = len(above_height)
print(above_height_len * 2 + (len(firends_height) - above_height_len))


(n, h) = [int(i) for i in input().split()]
data = [int(i) for i in input().split()]
res = []
for i in data:
	if i > h:
		res.append(2)
	else:
		res.append(1)
print(sum(res))


n = [*map(int, input().split())]
m = [*map(int, input().split())]
total = 0
for _ in m:
	if _ <= n[1]:
		total += 1
	else:
		total += 2
print(total)


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
c = 0
for i in a:
	if i > m:
		c = c + 1
print(c * 2 + (n - c) * 1)


(n, h) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
count = 0
for i in l:
	if i > h:
		count += 1
print(n + count)


(n, h_wall) = map(int, input().split(' '))
h_human = list(map(int, input().split(' ')))
count = 0
for i in range(n):
	if h_human[i] <= h_wall:
		count = count + 1
	else:
		count = count + 2
print(count)


(n, m) = map(int, input().split())
s = list(map(int, input().split()))
print(sum([1 + (i > m) for i in s]))


(N, H) = map(int, input().split())
A = list(map(int, input().split()))
K = sum((a > H for a in A))
print(N + K)


from sys import stdin, stdout
(n, h) = [int(c) for c in stdin.readline().split()]
res = 0
for x in stdin.readline().split():
	if int(x) > h:
		res += 2
	else:
		res += 1
stdout.write(str(res))


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
a = 0
b = 0
for i in range(len(l)):
	if l[i] > m:
		a += 1
	if l[i] <= m:
		b += 1
print(a * 2 + b)


import sys

def minimum_width(fence_height, heights):
	width = 0
	for (index, h) in enumerate(heights):
		if h <= fence_height:
			width += 1
		else:
			half = h / 2.0
			if half > fence_height:
				print('Error! Height still greater than fence height!')
				sys.exit(0)
			width += 2
	return width
first = input()
second = input()
(n, fence_height) = map(int, first.split())
heights = list(map(int, second.split()))
width = minimum_width(fence_height, heights)
print(width)


first = list(map(int, input().split()))
second = list(map(int, input().split()))
list = []
for i in second:
	if i <= first[1]:
		list.append(1)
	else:
		list.append(2)
sum = 0
for i in list:
	sum += i
print(sum)


a = input('')
b = input('')
c = a.split(' ')
d = b.split(' ')
x = int(c[1])
m = 0
for i in range(int(c[0])):
	if int(d[i]) <= x:
		m = m + 1
	elif int(d[i]) > x:
		m = m + 2
print(m)


(nPerson, lengthOfFence) = [int(x) for x in input().split()]
userInput = input()
data = userInput.split()
data = map(int, data)
total = 0
for i in data:
	if i <= lengthOfFence:
		total = total + 1
	else:
		total = total + 2
print(total)


(n, h) = input().split()
n = int(n)
h = int(h)
friends = input().split()
friends = [int(friend) for friend in friends]
counter = 0
for i in friends:
	if i > h:
		counter += 1
print(n + counter)


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


def vanyaFence(n, a, h):
	for i in a:
		if i > h:
			n += 1
	return n
(n, h) = map(int, input().split())
a = map(int, input().split())
print(vanyaFence(n, a, h))


(_, fence) = map(int, input().split())
print(sum((1 if height <= fence else 2 for height in map(int, input().split()))))


(n, h) = input().split()
h = int(h)
heights = input().split()
suma = 0
for a in heights:
	if int(a) <= h:
		suma += 1
	else:
		suma += 2
print(suma)


import bisect
(n, m) = map(int, input().split())
listt = list(map(int, input().split()))
listt.sort()
pos = bisect.bisect_right(listt, m)
if pos == n:
	print(n)
else:
	print((n - pos) * 2 + pos)


import sys
import math
(a, b) = map(int, input().split())
cnt = a
c = list(map(int, input().split()))
for i in c:
	if i > b:
		cnt += 1
print(cnt)


def road_len(p, h):
	w = 0
	for i in p:
		if i > h:
			w += 2
		else:
			w += 1
	return w

def io():
	(n, h) = map(int, input().split())
	p = list(map(int, input().split()))
	print(road_len(p, h))
io()


(n, height) = map(int, input().split())
num = n
for i in input().split():
	if int(i) > height:
		num += 1
print(num)


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


a = input('')
(x, y) = a.split()
x = int(x)
y = int(y)
c = input('')
f = c.split()
s = 0
for i in range(0, x):
	d = int(f[i])
	if d > y:
		s += 2
	else:
		s += 1
print(s)


def inlt():
	return list(map(int, input().split()))
[n, h] = inlt()
res = n
a = inlt()
for i in range(n):
	if a[i] > h:
		res += 1
print(res)


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


x = input()
x = x.split()
h = int(x[1])
y = input()
y = y.split()
l = []
for i in y:
	i = int(i)
	l.append(i)
c = 0
for i in l:
	if i > h:
		c += 2
	else:
		c += 1
print(c)


(n, h) = map(int, input().split())
l = map(int, input().split())
w = [2 if x > h else 1 for x in l]
print(sum(w))


(n, h) = input().split()
ls = input().split()
s = 0
for i in ls:
	if int(i) > int(h):
		s += 2
	else:
		s += 1
print(s)


l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ans = 0
for f in l2:
	if f > l1[1]:
		ans += 2
	else:
		ans += 1
print(ans)


(n, h) = input().split()
(n, h) = (int(n), int(h))
a = list(map(int, input().split()))
c = 0
if len(a) == n:
	for i in a:
		if i < h:
			c = c + 1
		elif i > h:
			if i % h == 0:
				q = i / h
				q = int(q)
				c = c + q
			elif i % h != 0:
				w = i / h
				w = int(w)
				w = w + 1
				c = c + w
		elif i == h:
			c = c + 1
print(c)


(n, h) = map(int, input().split())
hieghts = list(map(int, input().split()))
width = n
for i in hieghts:
	if i > h:
		width += 1
	else:
		pass
print(width)


(f, H) = map(int, input().split())
print(sum([1 if h <= H else 2 for h in map(int, input().split())]))


(a, b) = map(int, input().split())
arr = list(map(int, input().split()))
sum = 0
for i in arr:
	if i > b:
		sum += 1
	sum += 1
print(sum)


import math
(n, h) = (int(i) for i in input().split())
a = [int(i) for i in input().split()]
width = 0
for i in a:
	width += math.ceil(i / h)
print(width)


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


n_h = input().split()
n = int(n_h[0])
h = int(n_h[1])
width = 0
height_friend = input().split()
for num in range(n):
	height_friend[num] = int(height_friend[num])
for each in height_friend:
	if each <= h:
		width += 1
	else:
		width += 2
print(width)


(n, h) = map(int, input().split())
L = list(map(int, input().split()))
ans = 0
for i in L:
	if i <= h:
		ans += 1
	if i > h:
		ans += 2
print(ans)


z = input().split()
n = int(z[0])
h = int(z[1])
x = input().split()
minw = n
for item in x:
	if int(item) > h:
		minw += 1
	else:
		pass
print(minw)


import math

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(mi())
(n, h) = mi()
a = li()
res = 0
for i in range(n):
	if a[i] > h:
		res += 2
	else:
		res += 1
print(res)


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
ans = len(l)
for i in l:
	if i > k:
		ans += 1
print(ans)


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


(n, h) = map(int, input().split())
print(n + sum([int(g) > h for g in input().split()]))


inp1 = input().split(' ')
inp = input().split(' ')
width = 0
n = int(inp1[0])
h = int(inp1[1])
for i in inp:
	if int(i) > h:
		width += 2
	else:
		width += 1
print(width)


datos = list(str(input()).split())
personas = list(str(input()).split())
respuestas = []
contadoro = 0
for j in range(len(datos)):
	datos[j] = int(datos[j])
for j in range(len(personas)):
	personas[j] = int(personas[j])
for j in personas:
	if j > datos[1]:
		contadoro += 2
	elif j <= datos[1]:
		contadoro += 1
print(contadoro)


from sys import stdin as cin
h = int(cin.readline().split()[1])
print(sum([(int(x) > h) + 1 for x in cin.readline().split()]))


(n, h) = tuple(map(int, input().strip(' ').split(' ')))
hgths = list(map(int, input().strip(' ').split(' ')))
hgths = list(map(lambda x: 1 if x <= h else 2, hgths))
print(sum(hgths))


siz = list(input().split(' '))
inp = list(input().split(' '))
final = []
n = int(siz[0])
h = int(siz[1])
for i in range(0, n):
	final.append(int(inp[i]))
counter = 0
for i in range(0, n):
	if final[i] <= h:
		counter += 1
	else:
		counter += 2
print(counter)


inputs = input().split()
n = int(inputs[0])
h = int(inputs[1])
a = input().split()
res = 0
for i in range(0, n):
	ai = int(a[i])
	res = res + int(ai / h)
	if ai % h > 0:
		res = res + 1
print(res)


(n, h) = [int(x) for x in input().split()]
heights = [int(h) for h in input().split()]
total = n
for hei in heights:
	if hei > h:
		total += 1
print(total)


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


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
s = [1 for i in l if i <= m]
v = [2 for i in l if i // 2 <= m and i > m]
print(sum(s) + sum(v))


(n, h) = input().split()
height = input().split()
c = 0
for k in height:
	if int(k) > int(h):
		c += 2
	else:
		c += 1
print(c)


n = int(input().split()[1])
r = 0
for x in map(int, input().split()):
	r += (x + n - 1) // n
print(r)


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


(n, h) = input('').split()
n = int(n)
h = int(h)
road = 0
f = [int(i) for i in input('').split()]
for i in f:
	if i > h:
		road += 1
road += len(f)
print(road)


(N, H) = [int(x) for x in input().split()]
T = [int(x) for x in input().split()]
width = 0
for i in T:
	if i > H:
		width += 2
	else:
		width += 1
else:
	print(width)


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


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


(total, height) = map(int, input().split())
lst = list(map(int, input().split()))
count = 0
for i in range(total):
	if lst[i] > height:
		count += 2
	else:
		count += 1
print(count)


n = input().split()
hp = input().split()
s = 0
for i in range(int(n[0])):
	if int(hp[i]) <= int(n[1]):
		s = s + 1
	else:
		s = s + 2
print(s)


(num_friends, fence_height) = [int(a) for a in input().strip().split()]
road_width = 0
friends_height = [int(a) for a in input().strip().split()]
for height in friends_height:
	if height > fence_height:
		road_width += 2
	else:
		road_width += 1
print(road_width)


listy = list(map(int, input().split()))
list2 = list(map(int, input().split()))
n = listy[0]
hm = listy[1]
count = 0
for i in list2:
	if i > hm:
		count += 2
	else:
		count += 1
print(count)


(n, h) = list(map(int, input().split()))
height = list(map(int, input().split()))
a = 0
for item in height:
	if item <= h:
		a += 1
	elif item > h:
		a += 2
print(a)


from sys import exit as sys_ret
(friends, max_height) = map(int, input().split())
min_width = friends
for cur_height in input().split():
	min_width += 1 if int(cur_height) > max_height else 0
print(min_width)


num = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
minWidth = int(0)
for i in a:
	if i > num[1]:
		minWidth += 2
	else:
		minWidth += 1
print(minWidth)


ui = list(map(int, input().split()))
fri = list(map(int, input().split()))
h = ui[1]

def solve():
	res = 0
	for i in fri:
		if i > h:
			res += 2
		else:
			res += 1
	return res
print(solve())


(f, h) = [int(i) for i in input().split()]
f = [int(i) for i in input().split()]
s = 0
for l in range(len(f)):
	if f[l] > h:
		s += 2
	else:
		s += 1
print(s)


(n, h) = input().split()
n = int(n)
h = int(h)
hei = [int(x) for x in input().split()]
s = 0
for i in hei:
	if i <= h:
		s = s + 1
	else:
		s = s + 2
print(s)


(a, b) = input().split()
(a, b) = (int(a), int(b))
lst = [int(i) for i in input().split()]
m = 0
for t in lst:
	if t > b:
		m += 2
	else:
		m += 1
print(m)


(n, f) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
print(sum((1 if i <= f else 2 for i in l)))


(n, h) = map(int, input().split())
alturas = list(map(int, input().split()))
soma = 0
for altura in alturas:
	if altura > h:
		soma += 2
	else:
		soma += 1
print(soma)


l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
s = 0
for a in l2:
	s += 1
	if a > l1[1]:
		s += 1
print(s)


(a, b) = map(int, input().strip().split())
c = list(map(int, input().strip().split()))
c.sort(reverse=True)
for m in c:
	if m > b:
		a += 1
	else:
		break
print(a)


(a, b) = map(int, input().split())
y = input().split()
num = []
count = 0
for k in range(len(y)):
	num.append(int(y[k]))
for i in num:
	if i <= b:
		count += 1
	elif i > b:
		count += 2
print(count)


nh = input().split()
(n, h) = (int(nh[0]), int(nh[1]))
store = map(int, input().split())
minWidth = 0
for i in store:
	if i > h:
		minWidth += 2
	else:
		minWidth += 1
print(minWidth)


primera = True

def organiza(s, num):
	global primera
	l = ['' for i in range(num)]
	cont = 0
	for i in range(len(s)):
		if s[i] == ' ':
			cont += 1
		else:
			l[cont] += s[i]
	if primera:
		primera = False
		return (int(l[0]), int(l[1]))
	else:
		return l
lista = []
t = input()
(a, b) = organiza(t, 2)
n = input()
lista = organiza(n, a)
resultado = 0
for i in range(a):
	if int(lista[i]) > b:
		resultado += 2
	else:
		resultado += 1
print(resultado)


line1 = input()
n = int(line1.split()[0])
h = int(line1.split()[1])
line2 = input()
arr = list(map(int, line2.split()))
res = 0
for i in arr:
	res += 2 if i > h else 1
print(res)


from math import ceil
(n, h) = map(int, input().split())
ans = 0
heights = map(int, input().split())
ans = sum([ceil(x / h) for x in heights])
print(ans)


(n, h) = map(int, input().split())
array = list(map(int, input().split()))
total = 0
for number in array:
	total += 1 if number <= h else 2
print(total)


(x, y) = map(int, input().split(' '))
lista = [int(x) for x in input().split(' ')]
lista_2 = [int(r) for r in lista if r > y]
lista_3 = [int(b) for b in lista if b <= y]
print(len(lista_2) * 2 + len(lista_3))


line = input()
height = line.split()
height = int(height[-1])
input_2 = input()
x = input_2.split()
width = 0
for y in x:
	i = int(y)
	if i <= height:
		width += 1
	else:
		width += 2
print(width)


from sys import stdin, stdout
(n, h) = stdin.readline().split()
n = int(n)
h = int(h)
arr = [int(x) for x in stdin.readline().split()]
sums = 0
for i in range(len(arr)):
	if arr[i] > h:
		sums += 2
	else:
		sums += 1
stdout.write(str(sums))


a = input()
b = input()
arr1 = []
arr2 = []
count = 0

def getting(count, num, arr):
	for i in range(0, len(num)):
		if num[i] == ' ':
			arr.append(int(num[count:i]))
			count = i + 1
		elif i == len(num) - 1:
			arr.append(int(num[count:len(num)]))
	return arr
inn1 = getting(0, a, arr1)
inn2 = getting(0, b, arr2)
width = 0
for i in inn2:
	if i > inn1[1]:
		width += 2
	else:
		width += 1
print(width)


(a, h) = input().split(' ')
a = int(a)
h = int(h)
c = 0
a = list()
a = input().split(' ')
for i in range(len(a)):
	a[i] = int(a[i])
	if a[i] <= h:
		c += 1
	if a[i] > h:
		c += 2
print(c)


a = input().split(' ')
b = input().split(' ')
a[0] = int(a[0])
a[1] = int(a[1])
i = 0
m = 0
while i < a[0]:
	b[i] = int(b[i])
	if b[i] > a[1]:
		m = m + 2
	else:
		m = m + 1
	i = i + 1
print(m)


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


ele = [int(n) for n in input().split()]
num = ele[0]
height = ele[1]
friends = [int(n) for n in input().split()]
count = 0
for i in friends:
	if i > height:
		count += 2
	else:
		count += 1
print(count)


x = input().split()
x = [int(I) for I in x]
y = input().split()
y = [int(I) for I in y]
count1 = 0
count2 = 0
for i in y:
	if i > x[1]:
		count1 = count1 + 2
	elif i <= x[1]:
		count2 = count2 + 1
print(count1 + count2)


(s, h) = map(int, input().split())
heights = [int(i) for i in input().split()]
heights.sort()
for n in range(s):
	if heights[n] > h:
		print(n + (s - n) * 2)
		break
else:
	print(s)


(n, k) = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
cnt = 0
for li in l:
	if li <= k:
		cnt = cnt + 1
	else:
		cnt = cnt + 2
print(cnt)


(n, h) = map(int, input().split())
arr = list(map(int, input().split()))
countOfTallPeople = 0
for x in arr:
	if x > h:
		countOfTallPeople += 1
print(n - countOfTallPeople + countOfTallPeople * 2)


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


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


(n, h) = map(int, input().split())
arr = list(map(int, input().split()))
new_arr = []
for i in arr:
	if i > h:
		new_arr.append(2)
	else:
		new_arr.append(1)
print(sum(new_arr))


(n, thresh) = map(int, input().split())
nums = [int(x) for x in input().split()]
summ = 0
for num in nums:
	if num <= thresh:
		summ += 1
	else:
		summ += 2
print(summ)


a = input
(d, b) = map(int, a().split())
c = a().split()
print(sum(((int(i) > b) + 1 for i in c)))


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


nh = input().split(' ')
nh = [int(i) for i in nh]
inp = input().split(' ')
inp = [int(i) for i in inp]
Weite = nh[0]
for i in inp:
	if i > nh[1]:
		Weite += 1
print(Weite)


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


data = input().split()
n = int(data[0])
h = int(data[1])
height = input().split()
w = 0
for i in range(n):
	if int(height[i]) > h:
		w += 2
	else:
		w += 1
print(w)


(s, d) = list(map(int, input().split()))
et = list(map(int, input().split()))
sw = 0
for i in range(s):
	if et[i] <= d:
		sw = sw + 1
	else:
		sw = sw + 2
print(sw)


nh = input().split(' ')
h = int(nh[1])
ai = input().split(' ')
w = 0
for a in ai:
	if int(a) > h:
		w += 2
	else:
		w += 1
print(w)


first = input().split()
n = int(first[0])
h = int(first[1])
sum = 0
second = input().split()
for i in range(n):
	if int(second[i]) <= h:
		sum += 1
	else:
		sum += 2
print(sum)


def vanya(n_heights, h):
	counter = 0
	for height in n_heights:
		if height <= h:
			counter += 1
		else:
			counter += 2
	return counter
input_ = list(map(int, input().rstrip().split()))
n_heights = []
n = input_[0]
h = input_[1]
n_heights = list(map(int, input().rstrip().split()))
print(vanya(n_heights, h))


ls = input().split()
nums = input().split()
count = 0
for i in range(int(ls[0])):
	if int(nums[i]) > int(ls[1]):
		count += 1
	count += 1
print(count)


a = 0
(n, h) = [int(x) for x in input().split()]
high = input().split()
for i in range(n):
	if int(high[i]) <= h:
		a += 1
	elif int(high[i]) > h:
		a += 2
print(a)


(n, h) = [int(h) for h in input().split()]
heights = [int(h) for h in input().split()]
total = 0
for i in range(len(heights)):
	if heights[i] > h:
		total += 2
	else:
		total += 1
print(total)


(n, h) = map(int, input().split())
inn = map(int, input().split())
persons = [int(i) for i in inn]
sol = 0
for i in persons:
	if i <= h:
		sol = sol + 1
	else:
		sol = sol + 2
print(sol)


(n, h) = list(map(int, input().split()))
ai = list(map(int, input().split()))
res = 0
for i in ai:
	if i > h:
		res += 2
	if i <= h:
		res += 1
print(res)


import sys
ip_num = input()
n = int(ip_num.split(' ')[0])
h = int(ip_num.split(' ')[1])
per_array = []
width_array = []
sum = 0
if n >= 1 and n <= 1000:
	if h >= 1 and h <= 1000:
		per_array = list(map(int, input().split(' ')[:n]))
		if per_array[n - 1] <= 2 * h and per_array[0] >= 1:
			for i in range(n):
				if per_array[i] <= h:
					width_array.append(1)
				else:
					width_array.append(2)
else:
	sys.exit(0)
for i in range(len(width_array)):
	sum = sum + width_array[i]
print(sum)


(n, f) = map(int, input().split())
l = list(map(int, input().split()))
greater = [i for i in l if i > f]
res = 2 * len(greater) + 1 * abs(len(l) - len(greater))
print(res)


(n, h) = input().split(' ')
n = int(n)
h = int(h)
count = 0
x = [int(p) for p in input().split(' ')]
for i in range(n):
	if x[i] > h:
		count = count + 2
	if x[i] <= h:
		count = count + 1
print(count)


def main():
	(n, k) = map(int, input().split())
	arr = map(int, input().split())
	n += sum((1 for i in arr if i > k))
	print(n)
main()


(n, h) = input().split()
l = input().split()
n = int(n)
h = int(h)
p = []
c = 0
for i in range(0, n):
	m = int(l[i])
	p.append(m)
	if p[i] > h:
		c = c + 1
print(n - c + 2 * c)


def read_first_line():
	first_line = input()
	first_line = first_line.split(' ')
	return (first_line[0], first_line[1])

def read_second_line():
	second_line = input()
	return second_line.split(' ')

def main():
	(n, h) = read_first_line()
	(n, h) = (int(n), int(h))
	list_of_friends = read_second_line()
	list_of_friends = map(int, list_of_friends)
	min_width = 0
	for friend in list_of_friends:
		if friend > h:
			min_width += 2
		else:
			min_width += 1
	print(min_width)
main()


(n, m) = map(int, input().split())
t = map(int, input().split())
sum = 0
for i in t:
	if i > m:
		sum += 2
	else:
		sum += 1
print(sum)


(t, h) = [int(u) for u in input().split()]
arr = list(map(int, input().split()))
l = 0
for f in arr:
	if f > h:
		l += 2
	else:
		l += 1
print(l)


(width, h) = (int(x) for x in input().split())
heights = [int(x) for x in input().split()]
for i in heights:
	if i > h:
		width += 1
print(width)


fandh = list(map(int, input().split()))
heights = list(map(int, input().split()))
for i in range(fandh[0]):
	if heights[i] > fandh[1]:
		heights[i] = 2
	else:
		heights[i] = 1
print(sum(heights))


nh = [int(i) for i in input().split()]
p = [int(i) for i in input().split()]
h = nh[1]
c = 0
for i in p:
	c += 2 if i > h else 1
print(c)


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


(x, y) = map(int, input().split())
s = input().split()
z = 0
for i in range(x):
	if int(s[i]) <= y:
		z = z + 1
	else:
		z = z + 2
print(z)


(num_of_friends, height_of_fence) = [int(i) for i in input().split()]
answer = 0
height_of_friends = [int(i) for i in input().split()]
for i in height_of_friends:
	if i > height_of_fence:
		answer += 2
	else:
		answer += 1
print(answer)


(n_people, h_fence) = list(map(int, input().split()))
h_people = len(list(filter(lambda x: int(x) > h_fence, input().split())))
print(h_people * 2 + (n_people - h_people))


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


(friendCount, height) = map(int, input().strip().split())
friends = map(int, input().strip().split())
print(sum([1 for i in friends if i > height] + [friendCount]))


(p, h) = map(int, input().split())
h_p = list(map(int, input().split()))
w = 0
for people in h_p:
	if people <= h:
		w += 1
	else:
		w += 2
print(w)


(_, fence_width) = map(int, input().split())
li = list(map(int, input().split()))
width = 0
for i in li:
	if i > fence_width:
		width += 2
	else:
		width += 1
print(width)


num_hight = input().split()
n_h = list(map(int, num_hight))
tall = input().split()
tall1 = list(map(int, tall))
sum = 0
for i in tall1:
	if i <= n_h[1]:
		sum += 1
	else:
		sum += 2
print(sum)


(m, n) = map(int, input().split())
t = [int(x) for x in input().split()]
k = 0
for i in range(m):
	if t[i] <= n:
		k += 1
	else:
		k += 2
print(k)


(n, h) = map(int, input().split())
height = list(map(int, input().split()))
tall = 0
for x in range(n):
	if height[x] > h:
		tall = tall + 1
print(n + tall)


import sys

def main():
	(n, h) = map(int, sys.stdin.readline().split())
	people = [int(x) for x in sys.stdin.readline().split()]
	result = 0
	for x in people:
		if x <= h:
			result += 1
		else:
			result += 2
	print(result)
main()


[a, b] = input().split(' ')
a = int(a)
b = int(b)
cnt = 0
s = [int(k) for k in input().split(' ')]
cnt = 2 * sum([k > b for k in s]) + sum((k <= b for k in s))
print(cnt)


import sys
import time
fence_height = 0
heights = []
idx = 0
for line in sys.stdin:
	nums = line.split()
	if idx == 0:
		fence_height = int(nums[1])
		idx += 1
	else:
		for i in nums:
			heights.append(int(i))
		break
total = 0
for i in heights:
	if i > fence_height:
		total += 2
	else:
		total += 1
print(total)


(n, h) = [int(s) for s in input().split()]
a = [int(s) for s in input().split()]
sum = 0
for i in a:
	if i > h:
		sum += 2
	else:
		sum += 1
print(sum)


from math import ceil
(n, h) = input().split()
temp = input().split()
a = []
for i in range(int(n)):
	a.append(temp[i])
answer = 0
for i in a:
	answer += ceil(int(i) / int(h))
print(answer)


def main():
	width = 0
	(n, h) = input().split()
	heights = input().split()
	for height in heights:
		if int(height) > int(h):
			width += 2
		else:
			width += 1
	print(width)
main()


(friends, fence) = map(int, input().split(' '))
height = list(map(int, input().split(' ')))[:friends]
maxWidth = list()
for i in range(friends):
	if height[i] <= fence:
		a = 1
		maxWidth.append(a)
	elif height[i] > fence:
		b = 2
		maxWidth.append(b)
print(sum(maxWidth))


(n, h) = map(int, input().split())
ancho = 0
for hi in list(map(int, input().split())):
	if hi <= h:
		ancho += 1
	else:
		ancho += 2
print(ancho)


(n, h) = [int(x) for x in input().split()]
friends = [int(x) for x in input().split()]
width = 0
for i in friends:
	if i > h:
		width += 2
	elif i <= h:
		width += 1
print(width)


(a, b) = map(int, input().split())
print(sum(list(map(lambda x: 2 if int(x) > b else 1, input().split()))))


(people, zabor) = map(int, input().split())
rost = list(map(int, input().split()))
shirina = 0
for i in range(people):
	shirina += 1
	if rost[i] > zabor:
		shirina += 1
print(shirina)


fence_height = int(input().split(' ')[1])
width = 0
for friend_height in list(map(int, input().split(' '))):
	if friend_height > fence_height:
		width += 2
	else:
		width += 1
print(width)


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


(n, h) = map(int, input().split())
a = [int(x) for x in input().split()]
res = []
for i in a:
	if i > h:
		res.append(2)
	else:
		res.append(1)
print(sum(res))


(n, h) = input().split()
q = input().split()
counter = 0
for i in q:
	if int(i) <= int(h):
		counter += 1
	else:
		counter += 2
print(counter)


(n, h) = map(int, input().split())
line = list(map(int, input().split()))
tall = [x for x in line if x > h]
print(n + len(tall))


(n, h) = map(int, input().split())
L = [int(i) - h for i in input().split()]
sum = n
for i in L:
	if i > 0:
		sum += 1
print(sum)


(n, h) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
l.sort()
c = 0
for i in l:
	if i > h:
		break
	c += 1
print(c * 1 + (len(l) - c) * 2)


(quantity, height) = list(map(int, input().split()))
height_f = list(map(int, input().split()))
a = 0
for i in range(quantity):
	if height_f[i] > height:
		a = a + 2
	else:
		a = a + 1
print(a)


(x, y) = [int(x) for x in input().split(' ')]
d = input()
d_ne = d.split()
t = 0
for i in range(0, x):
	if int(d_ne[i]) <= y:
		t += 1
	if int(d_ne[i]) > y:
		t += 2
print(t)


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


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
d = c.sort()
counter = 0
min = b
for i in range(a):
	if c[i] <= min:
		counter += 1
	else:
		counter += 2
print(counter)


(num, height) = map(int, input().split())
l = list(map(int, input().split()))
count = 0
counts = 0
for i in range(len(l)):
	if l[i] > height:
		count += 2
	elif l[i] <= height:
		counts += 1
print(count + counts)


k = list(map(int, input().split()))
s = list(map(int, input().split()))
t = k[1]
c = 0
for i in s:
	if i > t:
		c += 2
	else:
		c += 1
print(c)


a = list(map(int, input().split()))
b = list(map(int, input().split()))
a1 = a[0]
a2 = a[1]
c = a1
for i in range(a1):
	if b[i] > a2:
		c += 1
print(c)


def cal_road_width(_a, _h):
	road_width = 0
	for ai in _a:
		road_width += 1 if ai <= _h else 2
	return road_width
(n, h) = map(int, input('').split())
a = list(map(int, input().split()))
print(cal_road_width(a, h))


(n, h) = map(int, input().split())
lst = [int(x) for x in input().split()]
space = 0
for i in lst:
	if i <= h:
		space = space + 1
	else:
		space = space + 2
print(space)


a = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
sum = 0
for i in arr:
	if i <= a[1]:
		sum += 1
	else:
		sum += 2
print(sum)


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


(n, h) = map(int, input().split())
result = 0
a_s = input().split()
for i in a_s:
	a = int(i)
	if a > h:
		result += 1
	result += 1
print(result)


(n, m) = (input().split(), input().split())
count = 0
for i in range(int(n[0])):
	if int(m[i]) <= int(n[1]):
		count += 1
	else:
		count += 2
print(count)


TN = 1

def solution():
	(n, h) = map(int, input().split())
	a = list(map(int, input().split()))
	ans = 0
	for i in range(n):
		if a[i] <= h:
			ans += 1
		else:
			ans += 2
	print(ans)
while TN != 0:
	solution()
	TN -= 1


hf = [int(i) for i in input().split()]
hp = input().split()
width = 0
for i in hp:
	if int(i) > hf[1]:
		width = width + 2
	else:
		width = width + 1
print(width)


(n, h) = map(int, input().split())
fr = list(map(int, input().split()))
c = 0
for x in fr:
	if h < x:
		c += 2
	else:
		c += 1
print(c)


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


(n, h) = map(int, input().split())
height = [int(x) for x in input().split()]
walk = 0
bent = 0
for i in range(n):
	if height[i] <= h:
		walk += 1
	else:
		bent += 1
wid = walk + 2 * bent
print(wid)


count = 0
(x, y) = map(int, input().split())
height = [int(x) for x in input().split()]
for i in height:
	if i > y:
		count = count + 2
	else:
		count = count + 1
print(count)


(n, h) = map(int, input().split(' '))
heights = map(int, input().split(' '))
road_width = 0
for height in heights:
	if height <= h:
		road_width += 1
	else:
		road_width += 2
print(road_width)


constraints = [int(c) for c in input().split()]
friends = [int(f) for f in input().split()]
width = len(friends)
for person in friends:
	if person > constraints[1]:
		width += 1
print(width)


a = input().split()[:2]
b = input().split()[:int(a[0])]
m = 0
for _ in b:
	if int(_) > int(a[1]):
		m += 2
	else:
		m += 1
print(m)


(n, h) = map(int, input().split())
ans = [2 if i > h else 1 for i in map(int, input().split())]
print(sum(ans))


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


def main():
	(n, h) = 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)
	pass
main()


def main():
	(n, m) = [int(v) for v in input().split()]
	vals = [int(v) for v in input().split()]
	c = sum([1 if v <= m else 2 for v in vals])
	print(c)
main()


def solve(li, h):
	count = 0
	for i in li:
		count = count + 1 if i <= h else count + 2
	return count
h = input().rstrip().split()[-1]
arr = list(map(int, input().rstrip().split()))
print(solve(arr, int(h)))


n = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
w = len(l)
while i < len(l) and l[i] > n[1]:
	w = w + 1
	i = i + 1
print(w)


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


(n, fence) = map(int, input().split())
arr = [int(x) for x in input().split()]
total = 0
for x in arr:
	if x > fence:
		total += 2
	else:
		total += 1
print(total)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
c = 0
for m in l:
	c = c + (m > h) + 1
print(c)


(_, height) = map(int, input().split())
heights = list(map(int, input().split()))
width = sum([2 if h > height else 1 for h in heights])
print(width)


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


(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
total = 0
for i in a:
	if i <= h:
		total += 1
	else:
		total += 2
print(total)


(n, h_fence) = map(int, input().split())
height = list(map(int, input().split()))
count = 0
for num in height:
	if num <= h_fence:
		count += 1
	else:
		count += 2
print(count)


liczby = input().split()
personsHeight = input().split()
friends = int(liczby[0])
fence = int(liczby[1])
min_width = 0
for i in range(friends):
	if int(personsHeight[i]) <= fence:
		min_width += 1
	else:
		min_width += 2
print(min_width)


(n, h) = [int(i) for i in input().split(' ')]
hp = [int(i) for i in input().split(' ')]
b = n
for i in range(n):
	if hp[i] > h:
		b += 1
print(b)


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


import math as mt
import sys as sy

class abc:

	def mkl(self):
		(n, k) = map(int, input().split())
		a = list(map(int, input().split()))
		aa = 0
		for i in a:
			aa += (i > k) + 1
		print(aa)
b = abc()
b.mkl()


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


(n, h) = input().split()
arr = [int(i) for i in input().split()]
for i in range(len(arr)):
	if arr[i] > int(h):
		arr[i] = 2
	elif arr[i] <= int(h):
		arr[i] = 1
print(sum(arr))


(number_of_frnds, minimum_height) = map(int, input().split())
heights = list(map(int, input().split()))
width_of_road = 0
for x in range(int(number_of_frnds)):
	if heights[x] > minimum_height:
		width_of_road += 2
	else:
		width_of_road += 1
print(width_of_road)


def gaurd(values, h):
	total = 0
	for i in range(len(values)):
		if values[i] <= h:
			total = total + 1
		elif values[i] > h:
			total = total + 2
	return total
(n, h) = map(int, input().split())
values = list(map(int, input().split()))
print(gaurd(values, h))


(n, h) = map(int, input().split())
a = [0 for x in input().split() if int(x) <= h]
print(len(a) + (n - len(a)) * 2)


people_count_fence_height = input('')
people_height = input('')
people_count_fence_height_lst = people_count_fence_height.split()
people_height_lst = people_height.split()
fence_height = people_count_fence_height_lst[1]
fence_height = int(fence_height)
width = 0
for height in people_height_lst:
	height = int(height)
	if height > fence_height:
		width += 2
	if height <= fence_height:
		width += 1
print(width)


(n, h) = [int(i) for i in input().split()]
lst = [int(i) for i in input().split()]
sum = n
for i in lst:
	if h < i:
		sum = sum + 1
print(sum)


(a, b) = map(int, input().split())
cnt = 0
k = list(map(int, input().split()))
if len(k) == a:
	for i in k:
		if i > b:
			cnt += 2
		else:
			cnt += 1
	print(cnt)


(number, fenceheight) = map(int, input().split())
friendsHeight = list(map(int, input().split()))
counter = 0
for value in friendsHeight:
	if value > fenceheight:
		counter += 1
print(counter + number)


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


(n, h) = input().split()
n = int(n)
h = int(h)
road_width = 0
firends_height_list = [int(x) for x in input().split(' ')]
for x in range(len(firends_height_list)):
	if firends_height_list[x] > h:
		road_width = road_width + 2
	else:
		road_width = road_width + 1
print(road_width)


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


a = input().split()
s = input().split()
d = int(a[0])
for i in s:
	if int(i) > int(a[1]):
		d += 1
print(d)


s = input().split()
h = int(s[1])
l = input().split()
br = 0
for i in l:
	if int(i) > h:
		br += 2
	else:
		br += 1
print(br)


(n, h) = [int(elem) for elem in input().split()]
width = n
growth = [int(elem) for elem in input().split()]
for i in range(n):
	if growth[i] > h:
		width += 1
print(width)


n = input().strip()
n = n.split(' ')
n = [int(j) for j in n]
l = input().strip()
l = l.split(' ')
l = [int(j) for j in l]
cnt = 0
for i in l:
	if i > n[1]:
		cnt = cnt + 2
	else:
		cnt = cnt + 1
print(cnt)


[n, h] = [int(num) for num in input().split()]
ans = 0
ht = [int(num) for num in input().split()]
for h1 in ht:
	if h1 > h:
		ans += 2
	else:
		ans += 1
print(ans)


(f, h) = input().split()
n = input().split()
res = 0
for i in range(int(f)):
	if int(n[i]) <= int(h):
		res += 1
	else:
		res += 2
print(res)


import sys
lines = sys.stdin.readlines()
(n, h) = map(int, lines[0].strip().split(' '))
nums = list(map(int, lines[1].strip().split(' ')))
res = 0
for num in nums:
	if num <= h:
		res += 1
	else:
		res += 2
print(res)


inputs = input().split()
heights = input().split()
threshold = int(inputs[1])
counter = 0
for x in heights:
	if threshold >= int(x):
		counter = counter + 1
	elif threshold < int(x):
		counter = counter + 2
print(counter)


numbers = [int(n) for n in input().split()]
nb = numbers[0]
hau = numbers[1]
a = 0
numbers = [int(n) for n in input().split()]
for loop in range(nb):
	n = numbers[loop]
	if hau < n:
		a = a + 2
	else:
		a = a + 1
print(a)


(n, h) = map(int, input().split())
hs = input().split()
count = 0
for i in hs:
	d = int(i)
	count += 1
	if d > h:
		count = count + 1
print(count)


n = list(map(int, input().split()))
g = list(map(int, input().split()))
count = 0
for x in g:
	if x <= n[1]:
		count += 1
	if x > n[1]:
		count += 2
print(count)


(n, k) = map(int, input().strip().split(' '))
aList = list(map(int, input().strip().split(' ')))
count = 0
for x in range(n):
	if aList[x] > k:
		count += 2
	else:
		count += 1
print(count)


from math import floor
(n, h) = map(int, input().split())
a = list(map(int, input().split()))
print(sum([1 if it <= h else 2 for it in a]))


(n, k) = map(int, input().split())
L = list(map(int, input().split()))
sum_ = n
for each in L:
	if each > k:
		sum_ += 1
print(sum_)


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


(_, lim) = input().split()
lim = int(lim)
res = 0
for a in input().split():
	a = int(a)
	if a > lim:
		res += 2
	else:
		res += 1
print(res)


c = 0
s = input()
s2 = s.split()
n = int(s2[0])
h = int(s2[1])
a1 = input()
a = a1.split()
for i in a:
	if int(i) > h:
		c = c + 1
print(c + n)


lst1 = int(input('').split(' ')[1])
lst2 = map(int, input('').split(' '))
r = 0
for j in lst2:
	r += 2 if j > lst1 else 1
print(r)


n = input().split()
(n, h) = (int(n[0]), int(n[1]))
ip = input().split()
ip = [int(i) for i in ip]
ip.sort()
i = 0
walk = 0
while i < n:
	if ip[i] > h:
		break
	walk += 1
	i += 1
print(walk + (n - walk) * 2)


(x, y) = input().split()
z = list(map(int, input().split()))
c = [i for i in z if i <= int(y)]
print((len(z) - len(c)) * 2 + len(c))


inp1 = input().split()
inp2 = input().split()
num = int()
for y in inp2:
	if int(y) > int(inp1[1]):
		num = num + 2
	else:
		num = num + 1
print(num)


(n, h) = [int(x) for x in input().split()]
users = [int(u) for u in input().split()]
width = 0
for person in users:
	if person > h:
		width += 2
	else:
		width += 1
print(width)


(x, y) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
k = 0
for i in range(x):
	if l[i] > y:
		k += 2
	else:
		k += 1
print(k)


value = input()
(a, b) = value.split()
a = int(a)
b = int(b)
values = input()
values = values.split()
values = [int(i) for i in values]
count = 0
for i in values:
	if i > b:
		count += 2
	else:
		count += 1
print(count)


nh = input().strip().split(' ')
n = int(nh[0])
h = int(nh[1])
s = [int(x) for x in input().strip().split(' ')]
w = 0
for x in s:
	if x > h:
		w = w + 2
	else:
		w = w + 1
print(w)


import sys
import itertools
fin = sys.stdin
(n, h) = fin.readline().split()
line = fin.readline()
width = 0
friends = line.split()
for i in friends:
	if int(i) <= int(h):
		width += 1
	else:
		width += 2
print(width)


import math
from collections import defaultdict
from collections import Counter
import itertools

def solve(n, h, A):
	ans = 0
	for i in range(n):
		if A[i] > h:
			ans += 2
		else:
			ans += 1
	return ans
temp = []
(n, h) = map(int, input().split(' '))
in_ = map(int, input().split(' '))
for x in in_:
	temp.append(int(x))
print(solve(n, h, temp))


(_, t) = map(int, input().split())
people = map(int, input().split())
tot = 0
for _ in people:
	if _ > t:
		tot += 2
	else:
		tot += 1
print(tot)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
wid = [1 for i in range(n)]
n = len(a)
for j in range(n):
	if a[j] > h:
		wid[j] = 2
print(sum(wid))


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


n = list(map(int, input().split()))
height = list(map(int, input().split()))
area = 0
for i in range(0, n[0]):
	if height[i] <= n[1]:
		area += 1
	else:
		area += 2
print(area)


(n, t) = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
for i in a:
	if i <= t:
		ans += 1
	else:
		ans += 2
print(ans)


a = [int(i) for i in input().split()]
b = a[1]
a = a[0]
y = 0
x = [int(i) for i in input().split()]
for i in x:
	if i > b:
		y += 2
	else:
		y += 1
print(y)


(n, h) = list(map(int, input().split(' ')))
ph = list(map(int, input().split(' ')))
count = 0
for x in ph:
	if x / h <= 1:
		count = count + 1
	else:
		count = count + 2
print(count)


(n, h) = [int(i) for i in input().split()]
l = [i for i in input().split() if int(i) > h]
print(n + len(l))


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


(n, h) = [int(x) for x in input().split()]
a = [int(y) for y in input().split()]
q = 0
for i in a:
	if i <= h:
		q += 1
	else:
		q += 2
print(q)


(n, h) = eval(input().replace(' ', ','))
a = eval(input().rstrip().replace(' ', ',') + ',')
width = 0
for ai in a:
	if ai > h:
		width += 2
	else:
		width += 1
print(width)


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


(n, h) = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
res = 0
for f in lst:
	if f > h:
		res += 2
	else:
		res += 1
print(res)


line_first = input('')
friends_size = input('')
line_first = line_first.split(' ')
n = int(line_first[0])
h = int(line_first[1])
friends_size = friends_size.split(' ')
summ = 0
for i in friends_size:
	if int(i) <= h:
		summ += 1
	else:
		summ += 2
print(summ)


(q, h) = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
z = 0
for i in x:
	if i <= h:
		z += 1
	elif i > h:
		z += 2
print(z)


first = input()
second = input()
friends = int(first.split()[0])
height = int(first.split()[1])
hfriends = list(map(int, second.split()))
count = 0
for i in range(len(hfriends)):
	if hfriends[i] > height:
		count += 2
		continue
	count += 1
print(count)


string = input()
stri = string.split()
for i in range(2):
	stri[i] = int(stri[i])
	i += 1
n = stri[0]
height = stri[1]
string1 = input()
stri1 = string1.split()
for i in range(n):
	stri1[i] = int(stri1[i])
	i += 1
width = 0
for i in range(n):
	if stri1[i] > height:
		width += 2
	elif stri1[i] <= height:
		width += 1
	i += 1
print(width)


(n, h) = map(int, input().split())
count = 0
heights = [int(i) for i in input().split()]
for height in heights:
	if height > h:
		count += 2
	else:
		count += 1
print(count)


while True:
	(n, h) = map(int, input().split(' '))
	if n >= 1 and n <= 1000 and (h >= 1) and (h <= 1000):
		break
a = input().split(' ')
sum = 0
for i in range(n):
	if int(a[i]) <= h:
		sum += 1
	else:
		sum += 2
print(sum)


(a, n) = map(int, input().split())
c = 0
l = list(map(int, input().split()))
for i in l:
	if i > n:
		c += 1
print(len(l) + c)


l1 = [int(x) for x in input().split()]
l2 = [int(x) for x in input().split()]
width = 0
for i in range(0, l1[0]):
	if l2[i] <= l1[1]:
		width = width + 1
	else:
		width = width + 2
print(width)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
counter = 0
for i in l:
	if i > h:
		counter += 1
print(counter * 2 + len(l) - counter)


def solve():
	(n, h) = map(int, input().split())
	f = list(map(int, input().split()))
	op = []
	for i in f:
		if i > h:
			op.append(2)
		else:
			op.append(1)
	return sum(op)
print(solve())


firstline = input('').split()
n = int(firstline[0])
h = int(firstline[1])
friends = input('').split()
new_list = list()
for friend in friends:
	if int(friend) <= h:
		new_list.append(1)
	else:
		new_list.append(2)
print(sum(new_list))


(a, b) = map(int, input().split())
p = list(map(int, input().split()))
c = 0
for i in range(0, len(p)):
	if b >= p[i]:
		c = c + 1
	elif b < p[i]:
		c = c + 2
print(c)


(a, b) = map(int, input().split())
c = [int(x) for x in input().split()]
d = a
for i in range(a):
	if c[i] > b:
		d += 1
print(d)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
x = 0
for i in range(len(a)):
	if a[i] <= h:
		x = x + 1
	elif a[i] > h:
		if a[i] % h == 0:
			x = x + a[i] // h
		else:
			x = x + a[i] // h + 1
print(x)


(n, h) = [int(c) for c in input().split()]
heights = [int(c) for c in input().split()]
width = n
for e in heights:
	if e > h:
		width += 1
print(width)


from collections import Counter
(n, h) = [int(x) for x in input().split()]
v = []
a = [int(y) for y in input().split()]
for i in a:
	if i < h or i == h:
		v.append(1)
	else:
		v.append(2)
print(sum(v))


k = input()
k = k.split()
inputs = int(k[0])
lim = int(k[1])
s = 0
k = input()
k = k.split()
for x in range(inputs):
	k[x] = int(k[x])
	if k[x] > lim:
		s += 2
	else:
		s += 1
print(s)


(length, h) = input().split(' ')
(length, h) = (int(length), int(h))
frnd_h = input().split(' ')
frnd_h = [int(i) for i in frnd_h]
bend_frnd = 0
for i in frnd_h:
	if i > h:
		bend_frnd += 1
minimum_width = length - bend_frnd + bend_frnd * 2
print(minimum_width)


(person, height) = input().split()
ls = []
cou = 0
while True:
	x = input()
	ls = [int(i) for i in x.split(' ')]
	if len(ls) == int(person):
		break
for i in ls:
	if int(i) <= int(height):
		cou += 1
	else:
		cou += 2
print(cou)


string = input()
numbers = string.split(' ')
n = int(numbers[0])
h = int(numbers[1])
string = input()
numbers = string.split(' ')
for x in range(n):
	temp = numbers[x]
	del numbers[x]
	numbers.insert(x, int(temp))
w = 0
for x in numbers:
	if x <= h:
		w += 1
	else:
		w += 2
print(w)


[n, h] = [int(i) for i in input().split(' ')]
ans = 0
lis = [int(i) for i in input().split(' ')]
for i in lis:
	n -= 1
	ans += 1
	if i > h:
		ans += 1
print(ans)


(nums, lens) = map(int, input().split(' '))
k = input().split(' ')
k = [int(k[i]) for i in range(nums)]
sums = 0
sumx = 0
for i in range(nums):
	if k[i] > lens:
		sums += 2
	elif k[i] <= lens:
		sumx += 1
counts = sums + sumx
print(counts)


a = input().split(' ')
c = int(a[0])
g = int(a[1])
m = 0
b = input().split(' ')
i = 0
while i < c:
	b[i] = int(b[i])
	i = i + 1
i = 0
while i < c:
	if b[i] < g:
		m = m + 1
	if b[i] > g:
		m = m + 2
	if b[i] == g:
		m = m + 1
	i = i + 1
print(m)


(n, h) = map(int, input().split())
friends = [int(i) for i in input().split()]
wid = len(friends)
for i in friends:
	if i > h:
		wid += 1
print(wid)


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


string = input()
s = string.split(' ')
n = int(s[0])
h = int(s[1])
ans = 0
string = input()
k = string.split(' ')
for i in range(n):
	if int(k[i]) > h:
		ans += 2
	else:
		ans += 1
print(ans)


def main():
	(n, h) = input().split(' ')
	a = input().split(' ')
	h = int(h)
	s = 0
	for e in a:
		s += 1 if int(e) <= h else 2
	print(s)
main()


(number, high) = input().split()
number = int(number)
high = int(high)
lines = input().split()
ans = 0
for i in range(number):
	if int(lines[i]) > high:
		ans += 2
	else:
		ans += 1
print(ans)


a = 0
(n, h) = [int(p) for p in input().split()]
people = [int(p) for p in input().split()]
for i in people:
	if i > h:
		a += 2
	else:
		a += 1
print(a)


(n, h) = map(int, input().split(' '))
alts = map(int, input().split(' '))
ancho = 0
for alt in alts:
	if alt > h:
		ancho += 2
	else:
		ancho += 1
print(ancho)


(n, h) = input().split(' ')
n = int(n)
h = int(h)
for i in range(0, n):
	person_height = input().split(' ')
	if len(person_height) == n:
		break
l = []
for i in person_height:
	l.append(int(i))
count = 0
for i in l:
	if i > h:
		count = count + 2
	else:
		count = count + 1
print(count)


(n, k) = map(int, input().split())
m = list(map(int, input().split()))
ans = 0
for i in m:
	if i > k:
		ans += 1
	ans += 1
print(ans)


(n, a) = map(int, input().split())
print(n + sum(map(lambda x: x > a, map(int, input().split()))))


n = [int(x) for x in input().split()]
list_ = [int(x) for x in input().split()]
m = 0
for i in range(n[0]):
	if list_[i] > n[1]:
		m = m + 2
	else:
		m = m + 1
print(m)


(n, h) = map(int, input().split())
hights = list(map(int, input().split()))
w = 0
for hight in hights:
	w += 1 + int(hight > h)
print(w)


MOD = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
from collections import *
(n, h) = f()
a = il()
c = 0
for i in range(n):
	if h - a[i] < 0:
		c = c + 2
	else:
		c = c + 1
print(c)


h = int(input().split()[1])
a = input().split()
ctr = 0
for i in a:
	if int(i) > h:
		ctr += 2
	else:
		ctr += 1
print(ctr)


a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
k = 0
for i in range(a[0]):
	if b[i] <= a[1]:
		k += 1
	else:
		k += 2
print(k)


(n, h) = map(int, input().split())
arr = [int(x) for x in input().split()]
ctr = 0
for ele in arr:
	if ele > h:
		ctr += 1
	ctr += 1
print(ctr)


l = []
for x in input().split():
	l.append(int(x))
height = l[1]
l.clear()
width = 0
for x in input().split():
	if int(x) > height:
		width += 2
	else:
		width += 1
print(width)


__author__ = 'artyom'

def main():
	(n, h) = read(3)
	c = 0
	for v in read(3):
		if v > h:
			c += 2
		else:
			c += 1
	return c

def read(mode=1, size=None):
	if mode == 0:
		return input().strip()
	if mode == 1:
		return int(input().strip())
	if mode == 2:
		return input().strip().split()
	if mode == 3:
		return list(map(int, input().strip().split()))
	a = []
	for _ in range(size):
		a.append(read(3))
	return a

def write(s='\n'):
	if s is None:
		s = ''
	if isinstance(s, tuple) or isinstance(s, list):
		s = ' '.join(map(str, s))
	s = str(s)
	print(s, end='\n')
res = main()
write(res)


(a, b) = input().split(' ')
list = []
a = int(a)
b = int(b)
d = input()
str = ''
cnt = 0
for i in range(len(d)):
	if d[i] != ' ':
		str = str + d[i]
	else:
		list.append(int(str))
		str = ''
	if i == len(d) - 1:
		list.append(int(str))
for i in range(len(list)):
	if list[i] > b:
		cnt += 2
	else:
		cnt += 1
print(cnt)


(friends, height) = map(int, input().split(' '))
heights = list(map(int, input().split()))
counter = 0
for h in heights:
	if h > height:
		counter += 2
	else:
		counter += 1
print(counter)


from sys import stdin
i = [[int(y) for y in x.rstrip().split()] for x in stdin.readlines()]
h = i[0][1]
print(sum((1 + (x > h) for x in i[1])))


from sys import stdin, stdout
(n_freinds, height) = map(int, stdin.readline().split())
freinds = list(map(int, stdin.readline().split()))
i = 0
row = 0
while i < n_freinds:
	if freinds[i] > height:
		row += 2
	else:
		row += 1
	i += 1
stdout.write(str(row) + '\n')


(num_friends, height_fence) = input().split()
num_friends = int(num_friends)
height_fence = int(height_fence)
friends = input().split()
width = 0
friends = [int(i) for i in friends]
for i in range(len(friends)):
	if friends[i] > height_fence:
		friends[i] = 2
	else:
		friends[i] = 1
for i in friends:
	width += i
print(width)


(n, h) = map(int, input().split())
l = [int(p) for p in input().split()]
width = 0
for height in l:
	if height > h:
		width += 2
	else:
		width += 1
print(width)


a = input().split(' ')
n = int(a[0])
h = int(a[1])
s = input().split(' ')
count = 0
for i in range(0, n):
	if int(s[i]) > h:
		count = count + 2
	elif int(s[i]) <= h:
		count = count + 1
print(count)


def findWidth(N, H, arr):
	w = 0
	for p in arr:
		if p > H:
			w += 2
		else:
			w += 1
	return w
(N, H) = map(int, input().split())
arr = list(map(int, input().split()))
print(findWidth(N, H, arr))


from sys import stdin, stdout
from math import ceil, floor
from collections import deque
inp = stdin.readline
out = stdout.write
(n, h) = map(int, inp().strip().split())
a = list(map(int, inp().strip().split()))
s = sum((1 if i <= h else 2 for i in a))
out(str(s))


(num, heigh) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
wid = 0
for i in range(num):
	if l[i] > heigh:
		wid += 2
	else:
		wid += 1
print(wid)


fence = list(map(int, input().split(' ')))
values = list(map(int, input().split(' ')))
sum = 0
for i in values:
	if int(i) <= fence[1]:
		sum += 1
	else:
		sum += 2
print(sum)


(x, y) = map(int, input().split())
z = list(map(int, input().split()))
total = 0
for i in range(x):
	if z[i] == y or z[i] < y:
		total = total + 1
	elif z[i] > y:
		total = total + 2
print(total)


(x, y) = map(int, input().split())
b = list(map(int, input().split()))
c = 0
for x in b:
	if x > y:
		c += 2
	else:
		c += 1
print(c)


(n, h) = map(int, input().split())
w = 0
x = 0
x = input()
l = x.split()
for x in range(len(l)):
	if int(l[x]) <= h:
		w += 1
	else:
		w += 2
print(w)


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

def main(n, h, l):
	result = 0
	for i in l:
		if h < i:
			result += 2
		elif h > i or h == i:
			result += 1
	return result
print(main(n, h, l))


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
length = len(l)
for i in l:
	if i > h:
		length += 1
print(length)


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


(n, h) = map(int, input().split())
k = sum((1 for x in map(int, input().split()) if h < x))
print(2 * k + n - k)


(n, k) = map(int, input().split())
s = 0
a = list(map(int, input().split()))
for i in range(len(a)):
	if a[i] % k == 0:
		s = s + a[i] // k
	else:
		s = s + a[i] // k + 1
print(s)


def solve(n, h, heights):
	width = 0
	for i in range(n):
		if heights[i] <= h:
			width += 1
		else:
			width += 2
	return width
(n, h) = list(map(int, input().split(' ')))
heights = list(map(int, input().split(' ')))
print(solve(n, h, heights))


input1 = input()
input2 = input()
num_friends = input1.split()[0]
fence = input1.split()[1]
width = 0
x = input2.split()
for i in range(len(x)):
	if int(x[i]) > int(fence):
		width = width + 2
	else:
		width = width + 1
print(width)


def vanya_and_fences(n, friends, h):
	width = 0
	for i in friends:
		if i > h:
			width += 2
		else:
			width += 1
	return width
(n, h) = map(int, input().split())
friends = list(map(int, input().split()))
print(vanya_and_fences(n, friends, h))


(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
w = 0
for x in a:
	if x > h:
		w += 2
		continue
	w += 1
print(w)


def func(n):
	x = list(map(int, input().split()))
	h = n[1]
	counter = 0
	for i in x:
		if i <= h:
			counter += 1
		else:
			counter += 2
	print(counter)
n = list(map(int, input().split()))
func(n)


(num, fence) = [int(x) for x in input().split()]
lst = map(int, input().split())
count = 0
for i in lst:
	if i > fence:
		count += 2
	else:
		count += 1
print(count)


(friend_num, fence) = list(map(int, input().split()))
friends = list(map(int, input().split()))
width = 0
for a in friends:
	if a > fence:
		width += 2
	else:
		width += 1
print(width)


max_height = int(input().split(' ')[1])
persons = input().split(' ')
result = 0
for x in persons:
	if int(x) > max_height:
		result = result + 2
	else:
		result = result + 1
print(result)


(x, y) = input().split()
x = int(x)
y = int(y)
w = 0
z = [int(z) for z in input().split()]
for dost in z:
	if dost <= y:
		w += 1
	else:
		w += 2
print(w)


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


(n, h) = map(int, input().split())
p = list(map(int, input().split()))
ans = sum(map(lambda x: 1 if x <= h else 2, p))
print(ans)


(y, z) = input().split(' ')
(y, z) = (int(y), int(z))
all_h = input().split(' ')
total = 0
for h in all_h:
	if int(h) > z:
		total += 2
	else:
		total += 1
print(total)


(T, A) = map(int, input().split())
L = list(map(int, input().split()))
ANS = 0
for I in range(T):
	if L[I] > A:
		ANS += 2
	else:
		ANS += 1
print(ANS)


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


(n, h) = list(map(int, input().split()))
num = lambda : map(int, input().split())
ll = num()
lll = []
for j in ll:
	if j <= h:
		lll.append(1)
	else:
		lll.append(2)
print(sum(lll))


(n, h) = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
k = 0
for i in l:
	if i > h:
		k = k + 1
	else:
		continue
print(k + n)


values = input().split()
num_people = values[0]
fence_height = int(values[1])
peoples_heights = input().split()
peoples_heights = [int(i) for i in peoples_heights]
n = 0
for person in peoples_heights:
	if person > fence_height:
		n = n + 2
	else:
		n = n + 1
print(n)


str1 = input()
nums1 = str1.split(' ')
nums1 = [int(nums1[i]) for i in range(len(nums1))]
str2 = input()
nums2 = str2.split(' ')
nums2 = [int(nums2[i]) for i in range(len(nums2))]
res = 0
for i in range(nums1[0]):
	if nums2[i] > nums1[1]:
		res += 2
	else:
		res += 1
print(res)


(a, b) = list(map(int, input().split()))
ls = list(map(int, input().split()))
res = 0
for i in ls:
	if i > b:
		res += 2
	if i <= b:
		res += 1
print(res)


r = input
(n, h) = map(int, r().split())
nums = list(map(int, r().split()))
print(n + sum([_ > h for _ in nums]))


(n, h) = map(int, input().split())
tot = 0
friends = map(int, input().split())
for f in friends:
	tot = tot + 2 if f > h else tot + 1
print(tot)


(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()])))


splited = input()
y = 'yes'
line = list(map(int, (x for x in splited.split() if x.isdigit())))
nums = input()
students = list(map(int, (x for x in nums.split() if x.isdigit())))
i = 0
num = 0
while i < line[0]:
	if students[i] > 0:
		if students[i] <= line[1]:
			num += 1
			i += 1
		else:
			num += 2
			i += 1
	else:
		y = 'no'
		break
if y == 'yes':
	print(num)


def solution(arr, n, h):
	ctr = 0
	for i in arr:
		if i <= h:
			ctr += 1
		else:
			ctr += 2
	return ctr
(n, h) = map(int, input().split())
arr = list(map(int, input().split()))
print(solution(arr, n, h))


value = input()
(N, h) = value.split(' ')
N = int(N)
h = int(h)
w = 0
k = []
for b in input().split():
	k.append(int(b))
for i in range(N):
	if k[i] > h:
		w += 2
	else:
		w += 1
print(w)


(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
w = 0
for i in range(n):
	if a[i] < h:
		w += 1
	elif a[i] % h == 0:
		w += a[i] // h
	else:
		w += a[i] // h + 1
print(w)


(N, k) = map(int, input().split())
arr = list(map(int, input().split()))
for i in range(len(arr)):
	if arr[i] > k:
		arr[i] = 2
	else:
		arr[i] = 1
print(sum(arr))


operations_list = []
num = 0
(n, m) = map(int, input().split())
friends = list(map(int, input().split()))
for i in friends:
	if i <= m:
		num += 1
	else:
		num += 2
print(num)


I = input
h = int(I().split()[-1])
print(sum((1 if i <= h else 2 for i in map(int, I().split()))))


li = list(map(int, input().split(' ')))
n = li[0]
h = li[1]
li = list(map(int, input().split(' ')))
wt = []
for i in li:
	if i > h:
		wt.append(2)
	else:
		wt.append(1)
print(sum(wt))


ls = []
while True:
	try:
		line = input()
	except EOFError:
		break
	ls.append(line)
(n, h) = ls[0].split()
h = int(h)
h_list = list(map(int, ls[1].split()))
fila = []
for x in h_list:
	if x > h:
		fila.append(2)
	else:
		fila.append(1)
print(sum(fila))


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


(num, height) = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = sum((2 if i > height else 1 for i in a))
print(cnt)


import sys
count = 0
lst = []
lst = list(map(int, input().split()))
height = []
height = list(map(int, input().split()))
for i in height:
	if i <= lst[1]:
		count += 1
	else:
		count += 2
print(count)


(a, b) = map(int, input().split())
z = list(input().split())
m = 0
for i in range(a):
	if int(z[i]) > b:
		m += 2
	else:
		m += 1
print(m)


from sys import stdin
_input = stdin.readline
_int = int

def solution():
	(n, h) = [_int(i) for i in _input().split()]
	arr = [_int(i) for i in _input().split()]
	ans = 0
	for i in arr:
		if i > h:
			ans += 2
		else:
			ans += 1
	print(ans)
solution()


a = input().split()
s = input().split()
c = 0
for i in range(int(a[0])):
	if int(s[i]) % int(a[1]) == 0:
		c += int(s[i]) // int(a[1])
	else:
		c += int(s[i]) // int(a[1]) + 1
print(c)


import sys
import math
h = [int(j) for j in input().split()][1]
ppl = [int(j) for j in input().split()]
print(sum([1 if n <= h else 2 for n in ppl]))


def check(input):
	global ans
	if input > h:
		ans = ans + 2
	else:
		ans = ans + 1
(num, h) = map(int, input().split(' '))
line2 = map(int, input().split(' '))
ans = 0
for i in line2:
	check(int(i))
print(ans)


nh = input().split()
n = int(nh[0])
h = int(nh[1])
heights = input().split()
ans = 0
for ht in heights:
	if int(ht) > h:
		ans += 2
	else:
		ans += 1
print(ans)


numbers = [int(i) for i in input().split()]
num_friends = numbers[0]
height = numbers[1]
new_numbers = [int(i) for i in input().split()]
length = 0
for x in range(num_friends):
	if new_numbers[x] > height:
		length += 2
	else:
		length += 1
print(length)


import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
(N, H) = map(int, input().split())
A = [int(x) for x in input().split()]
a = len([x for x in A if x <= H])
b = N - a
print(a + b * 2)


(x, y) = map(int, input().split())
xy = 0
w = list(map(int, input().split()))
for i in range(0, x):
	if w[i] > y:
		xy += 2
	else:
		xy += 1
print(xy)


num = list(map(int, input().rstrip().split()))
n = num[0]
h = num[1]
sum = n
a = list(map(int, input().rstrip().split()))
for i in range(0, n):
	if a[i] > h:
		sum += 1
print(sum)


main = input().split()
n = int(main[0])
h = int(main[1])
s = 0
friends = input().split()
for i in range(0, n):
	friends[i] = int(friends[i])
for i in range(0, n):
	if friends[i] > h:
		s += 2
	else:
		s += 1
print(s)


(n, h) = map(int, input().split())
counter = 0
hf = list(map(int, input().split()))
for elemento in hf:
	if elemento > h:
		counter += 2
	else:
		counter += 1
print(counter)


def main():
	(n, h) = [int(it) for it in input().split(' ')]
	friends = [int(it) for it in input().split(' ')]
	width = 0
	for friend in friends:
		if friend > h:
			width = width + 2
		else:
			width = width + 1
	print(width)
main()


a = str(input()).split(' ')
b = str(input()).split(' ')
mh = a[1]
s = 0
for ele in b:
	if int(ele) > int(mh):
		s += 2
	else:
		s += 1
print(s)


x = input().split(' ')
n = int(x[0])
h = int(x[1])
a = input().split(' ')
count = 0
for j in range(n):
	if int(a[j]) <= h:
		count = count + 1
	else:
		count = count + 2
print(count)


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


(n, h) = [int(x) for x in input().split()]
friends = [int(x) for x in input().split()]
width = 0
for friend in friends:
	if friend > h:
		width += 2
	else:
		width += 1
print(width)


(num_friends, height_fence) = list(map(int, input().split()))
height_friends = list(map(int, input().split()))
count_shorter = len(list(filter(lambda h: h <= height_fence, height_friends)))
count_taller = num_friends - count_shorter
print(count_shorter + 2 * count_taller)


(n, h) = [int(x) for x in input().split()]
hi = [int(x) for x in input().split()]
count = 0
for x in range(len(hi)):
	if hi[x] > h:
		count += 2
	else:
		count += 1
print(count)


from sys import stdin, stdout
(n, h) = stdin.readline().split()
n = int(n)
h = int(h)
friends = [int(x) for x in stdin.readline().split()]
s = 0
for f in friends:
	if f > h:
		s = s + 2
	else:
		s = s + 1
print(s)


u = 0
listA = []
(n, h) = map(int, input('').split())
listA = [int(x) for x in input('').split()]
for i in listA:
	if i > h:
		u += 2
	else:
		u += 1
print(u)


from sys import stdin, stdout
(n, h) = input().split()
n = int(n)
h = int(h)
arr = [int(x) for x in input().split()]
i = 0
sum1 = 0
for i in range(n):
	if arr[i] > h:
		width = 2
	else:
		width = 1
	sum1 = sum1 + width
	i = i + 1
print(sum1)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
d = len(list(filter(lambda x: x > h, a)))
print(n - d + 2 * d)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
cnt = 0
for num in a:
	if num <= h:
		cnt += 1
	else:
		cnt += 2
print(cnt)


Line1 = input('')
Line2 = input('')
Parameter = list(map(int, Line1.split(' ')))
h = Parameter[1]
N = Parameter[0]
Array = list(map(int, Line2.split(' ')))
min_width = 0
for itr in range(0, N):
	if Array[itr] > h:
		min_width += 2
	elif Array[itr] <= h:
		min_width += 1
print(min_width)


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


(n, h) = map(int, input().split())
arr = list(map(int, input().split()))
min_width = 0
for ele in arr:
	if ele > h:
		min_width += 2
	else:
		min_width += 1
print(min_width)


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


q = list(map(int, input().split(' ')))
h = list(map(int, input().split(' ')))
k = 0
for i in h:
	if i > q[1]:
		k = k + 2
	else:
		k = k + 1
print(k)


(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(len(a)):
	if i > n:
		a.remove(i)
w = 0
for x in range(n):
	if a[x] <= h:
		w += 1
	elif a[x] > h:
		w += 2
print(w)


def main():
	(lim, h) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	width = 0
	for x in arr:
		if x > h:
			width += 2
		else:
			width += 1
	print(width)
main()


(n, h) = map(int, input().split())
b = tuple(map(int, input().split()))
s = 0
for i in range(n):
	if b[i] <= h:
		s += 1
	else:
		s += 2
print(s)


(fr, heigh) = input().split(' ')
heigh = int(heigh)
list_fr = input().split(' ')
length = 0
for i in list_fr:
	i = int(i)
	if i <= heigh:
		length += 1
	if i > heigh:
		length = length + 2
print(length)


(n, p) = map(int, input().split())
s = 0
a = list(map(int, input().split()))
from math import ceil
for i in a:
	s += ceil(i / p)
print(s)


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


i = input
c = 0
l = [*map(int, i().split())]
List = [*map(int, i().split())]
for j in List:
	if j > l[1]:
		c += 2
	else:
		c += 1
print(c)


(p, j) = map(int, input().split())
c = 0
l = list(map(int, input().split()))
for i in range(p):
	if l[i] <= j:
		c = c + 1
	else:
		c = c + 2
print(c)


(a, b) = map(int, input().split())
k = list(map(int, input().split()))
c = 0
for i in range(a):
	if k[i] < b or k[i] == b:
		c = c + 1
	if k[i] > b:
		c = c + 2
print(c)


(n, h) = map(int, input().split())
fhs = list(map(int, input().split()))
result = len(fhs) + len([l for l in fhs if l > h])
print(result)


yolo = [int(x) for x in input().split()]
maxi = [int(x) for x in input().split()]
count = 0
for i in maxi:
	if yolo[1] >= i:
		count += 1
	else:
		count += 2
print(count)


(a, b) = map(int, input().split())
A = map(int, input().split())
k = 0
for i in A:
	if i > b:
		k += 2
	else:
		k += 1
print(k)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
k = 0
for i in a:
	if i > h:
		k += 1
b = len(a) - k
c = 2 * k + b
print(c)


from sys import stdin, exit
(n, h) = map(int, stdin.readline().rstrip().split(' '))
peps = list(map(int, stdin.readline().rstrip().split(' ')))
total = 0
for p in peps:
	if p > h:
		total += 2
	else:
		total += 1
print(total)


(friends, height) = map(int, input().split())
friends_height = [int(item) for item in input().split()]
rest = 0
for f_height in friends_height:
	if f_height > height:
		rest += 1
print(len(friends_height) + rest)


(n, m) = map(int, input().split())
lis = list(map(int, input().split()))
ss = [2] * n
ss = sum([1 if i <= m else 2 for i in lis])
print(ss)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
print(sum([[1, 2][a[i] > h] for i in range(n)]))


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


a = input('')
b = input('')
x = a.split(' ')
y = b.split(' ')
response = [2 if int(i) > int(x[1]) else 1 for i in y]
print(sum(response))


from array import *
(a, b) = map(int, input().split())
aa = input().split()
av = array('i', [])
sum = 0
for i in range(a):
	av.append(int(aa[i]))
	if av[i] > b:
		sum = sum + 2
	else:
		sum = sum + 1
print(sum)


(n, k) = map(int, input().split())
r = list(map(int, input().split()))
res = 0
for i in range(n):
	if r[i] <= k:
		res += 1
	else:
		res += 2
print(res)


n = input()
n = n.split()
y = int(n[1])
b = input()
b = b.split()
c = 0
for k in range(len(b)):
	if int(b[k]) > y:
		c = c + 1
	c = c + 1
print(c)


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


s = input().split()
n = int(s[0])
h = int(s[1])
m = input().split()
count = 0
for i in m:
	i = int(i)
	if i > h:
		count = count + 2
	else:
		count = count + 1
print(count)


(number, height) = map(int, input().split())
heigh = list(map(int, input().split()))
width = 0
for i in range(number):
	if heigh[i] <= height:
		width += 1
	else:
		width += 2
print(width)


nh = input().split(' ')
n = int(nh[0])
h = int(nh[1])
a = input()
a = list(map(int, a.split(' ')))
w = 0
for i in range(n):
	w += 1
	if a[i] > h:
		w += 1
print(w)


l = list(map(int, input().split()))
rost = list(map(int, input().split()))
o = 0
for x in rost:
	if x <= l[1]:
		o += 1
	else:
		o += 2
print(o)


def getMinimumPossibleWidth(fenceHeight, friends):
	width = 0
	for i in range(len(friends)):
		if friends[i] > fenceHeight:
			width += 2
		else:
			width += 1
	return width
nH = list(map(int, input().rstrip().split()))
friends = list(map(int, input().rstrip().split()))
print(getMinimumPossibleWidth(nH[1], friends))


def fun():
	(n, h) = map(int, input().split())
	ls = []
	sum = 0
	a = list(map(int, input().split()))
	for i in a:
		if i <= h:
			sum = sum + 1
		elif i > h:
			sum = sum + 2
	return sum
print(fun())


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


def get_value():
	(friend_count, fence_height) = [int(val) for val in input().split()]
	friend_heights = [int(val) for val in input().split()]
	short_friends_count = len(list(filter(lambda x: x <= fence_height, friend_heights)))
	tall_friends_count = friend_count - short_friends_count
	return short_friends_count + tall_friends_count * 2
print(get_value())


import sys

def solve():
	(n, h) = [int(x) for x in input().split(' ')]
	arr = [int(x) for x in input().split(' ')]
	ans = 0
	for x in arr:
		if x > h:
			ans += 2
		else:
			ans += 1
	return ans
ans = solve()
print(ans)


b = list(map(int, input().rstrip().split()))
a = list(map(int, input().rstrip().split()))
n = b[0]
h = b[1]
j = 0
for i in range(n):
	if a[i] > h:
		j += 1
result = j * 2 + (n - j)
print(result)


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

def findwidth(n, h, arr):
	w = 0
	for i in range(n):
		if arr[i] > h:
			w = w + 2
		else:
			w = w + 1
	return w
print(findwidth(n, h, arr))


(n, h) = map(int, input().split())
heights = list(map(int, input().split()))
wd = 0
for hg in heights:
	if hg > h:
		wd += 2
	else:
		wd += 1
print(wd)


a = input()
(n, h) = a.split()
b = input().split(' ')
sum = 0
for j in b:
	if int(j) > int(h):
		sum += 2
	else:
		sum += 1
print(sum)


(a, b) = [int(x) for x in input().split(' ')]
c = [int(i) for i in input().split(' ')]
k = 0
for i in c:
	if i > b:
		k += 1
print(a + k)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
from math import log
if h == 1:
	print(sum(a))
else:
	l = 0
	for i in a:
		l += 1 if i <= h else 2 ** int(log(i) / log(h))
	print(l)


def solution(A, h):
	ans = 0
	for i in A:
		ans += 2 if i > h else 1
	return ans
(n, h) = input().split(' ')
n = int(n)
h = int(h)
A = input().split(' ')
A = [int(i) for i in A]
print(solution(A, h))


(a, b) = [int(x) for x in input().split()]
p = [int(y) for y in input().split()]
z = 0
for i in range(0, a):
	if p[i] > b:
		z = z + 2
	else:
		z = z + 1
print(z)


(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)


sum = 0
num = list(map(int, input().split()))
array = list(map(int, input().split()))
n = num[0]
h = num[1]
for q in range(0, n):
	first = array[q]
	if first > h:
		sum = sum + 2
	else:
		sum = sum + 1
print(sum)


def myMethod(n, h, l):
	count = n
	for i in range(n):
		if l[i] > h:
			count += 1
	return count
(n, h) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
print(myMethod(n, h, l))


fore = input().split()
sight = input().split()
king = int(fore[0])
for i in sight:
	if int(i) > int(fore[1]):
		king += 1
print(king)


from math import *

def main():
	(n, h) = map(int, input().split())
	a = list(map(int, input().split()))
	ans = 0
	for i in a:
		if i > h:
			ans += 1
		ans += 1
	print(ans)
main()


(count_friends, vis) = map(int, input().split())
friends = [int(i) for i in input().split()]
count_of_gigantic = 0
normal = 0
for i in friends:
	if i > vis:
		count_of_gigantic += 1
	else:
		normal += 1
print(count_of_gigantic * 2 + normal)


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()


s = input
(a, y) = map(int, s().split())
print(a + len([t for t in map(int, s().split()) if t > y]))


(n_p, h_l) = map(int, input().split())
p_h = list(map(int, input().split()))
s_1 = 0
s_2 = 0
for person in p_h:
	if person > h_l:
		s_2 += 1
	else:
		s_1 += 1
ans = s_1 * 1 + s_2 * 2
print(ans)


(n, k) = map(int, input().split())
lis = [int(x) for x in input().split()]
ans = n
for i in lis:
	if i > k:
		ans += 1
print(ans)


def main():
	from sys import stdout
	(n, h) = map(int, input().split())
	lis = list(map(int, input().split()))
	count = 0
	for el in lis:
		if el > h:
			count += 2
		else:
			count += 1
	stdout.write(str(count))
main()


[numFriends, heightFence] = list(map(int, input().split()))
heightPerson = list(map(int, input().split()))
width = 0
for i in range(numFriends):
	if heightPerson[i] <= heightFence:
		width += 1
	else:
		width += 2
print(width)


(n, h) = map(int, input().split())
friends = [int(x) for x in input().split()]
cnt = 0
for x in friends:
	if x > h:
		cnt += 2
	else:
		cnt += 1
print(cnt)


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


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


(n, h) = input().split(' ')
n = int(n)
h = int(h)
li = input().split(' ')
li = list(map(int, li))
res = n
for i in li:
	if i > h:
		res += 1
print(res)


details = [int(s) for s in input().split(' ')]
yo = details[0]
fhts = [int(s) for s in input().split(' ')]
for i in fhts:
	if i > details[1]:
		yo += 1
print(yo)


import math
import re
(a, b) = map(int, input().split(' '))
c = list(map(int, input().split(' ')))
width = 0
for i in c:
	width += 1
	if i > b:
		width += 1
print(width)


(n, hf) = map(int, input().split())
h = list(map(int, input().split()))
w = int(0)
for i in range(0, n):
	if h[i] <= hf:
		w = w + 1
	else:
		w = w + 2
print(w, end='')


def find_width(n, h, hlist):
	width = 0
	for i in hlist:
		if i > h:
			width = width + 2
		else:
			width += 1
	return width
(n, h) = map(int, input().rstrip().split())
hlist = list(map(int, input().rstrip().split()))
print(find_width(n, h, hlist))


(a, b) = input().split()
c = input()
cn = 0
d = list(c.split())
for i in range(int(a)):
	if int(b) < int(d[i]):
		cn += 2
	else:
		cn += 1
print(cn)


(n, h) = map(int, input().split())
s = list(map(int, input().split()))
print(len(s) + sum([1 * (s[i] > h) for i in range(len(s))]))


import math
string = input()
(n, h) = string.split()
n = int(n)
h = int(h)
array = input()
a = array.split()
ans = 0
for i in a:
	if int(i) > h:
		ans += 1
print(ans + n)


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


c = 0
lis = []
lis_hig = []
lis.append(input().split())
lis_hig.append(input().split())
for i in range(int(lis[0][0])):
	if int(lis_hig[0][i]) > int(lis[0][1]):
		c += 2
	else:
		c += 1
print(c)


(_, h) = map(int, input().split())
a = list(map(int, input().split()))
w = 0
for h_f in a:
	if h_f > h:
		w += 1
	w += 1
print(w)


(n, h) = input().split()
(n, h) = (int(n), int(h))
friends = input().split()
friends = [int(i) for i in friends]
s = 0
i = 0
for i in range(n):
	if friends[i] > h:
		s += 2
	elif friends[i] <= h:
		s += 1
print(s)


nh = [int(i) for i in input().split()]
(n, zabor) = (nh[0], nh[1])
heights = [int(i) for i in input().split()]
wid = 0
for h in heights:
	if h > zabor:
		wid += 2
	else:
		wid += 1
print(wid)


import math

def handler(input):
	(num_of_friends, height_fence) = [int(x) for x in input[0].split(' ')]
	list_height_friends = [int(x) for x in input[1].split(' ')]
	min_width = 0
	for x in list_height_friends:
		min_width += math.ceil(x / height_fence)
	return min_width
first_input = input()
second_input = input()
print(handler((first_input, second_input)))


class chk:

	def check_hight(self, x, a):
		cntr = 0
		n = x[0]
		h = x[1]
		for ai in a:
			if ai > h:
				cntr += 2
			else:
				cntr += 1
		return cntr

	def intol(self, l):
		return [int(i) for i in l]
c = chk()
print(c.check_hight(c.intol(input().split()), c.intol(input().split())))


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


(n, h) = input().split(' ')
n = int(n)
h = int(h)
lst = list()
lst = input().split(' ')
width = 0
for i in lst:
	j = int(i)
	if j <= h:
		width += 1
	else:
		width += 2
print(width)


def fun(a):
	global h
	global r
	if int(a) <= h:
		r += 1
	else:
		r += 2
r = 0
(n, h) = map(int, input().split())
l = list(map(fun, input().split()))
print(r)


from math import *
(n, h) = map(int, input().split())
a = list(map(int, input().split()))
counter = 0
for i in a:
	if i <= h:
		counter += 1
	else:
		counter += ceil(i / h)
print(counter)


n = list(map(int, input().split()))
(a, b) = (n[0], n[1])
lst = list(map(int, input().split()))
ans = 0
for i in lst:
	if i > b:
		ans += 1
print(ans + a)


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


(moves, h) = input().split(' ')
(moves, h) = (int(moves), int(h))
arr = input().split(' ')
for height in arr:
	if int(height) > h:
		moves += 1
print(moves)


x = input().split()
n = int(x[0])
h = int(x[1])
s = input().split()
tall = 0
for i in s:
	i = int(i)
	if i > h:
		tall += 1
print(n + tall)


(n, h) = input().split()
n = int(n)
h = int(h)
l1 = [int(x) for x in input().split() if int(x) > h]
print(2 * len(l1) + (n - len(l1)))


(n, h) = map(int, input().split())
heights = map(int, input().split())
width = 0
for height in heights:
	if height <= h:
		width += 1
	elif height > h:
		width += 2
print(width)


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


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


def convert(arr):
	ans = []
	for i in arr:
		ans.append(int(i))
	return ans
inp = convert(input().split())
arr = convert(input().split())
ans = 0
for i in arr:
	if i > inp[1]:
		ans += 2
	else:
		ans += 1
print(ans)


_1 = '236a'
_2 = '339a'
_3 = '266a'
_4 = '96a'
_5 = '236a'
_6 = '281a'
_7 = '546a'
_8 = '116a'
_9 = '977a'
_10 = '266b'
_11 = '110a'
_12 = '41a'
_13 = '734a'
_14 = '133a'
_15 = '467a'
_16 = '158a'
_17 = '677a'
count = 0
(n, h) = map(int, input().split())
l = list(map(int, input().split()))
for i in l:
	if i > h:
		count += 2
	else:
		count += 1
print(count)


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


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


from sys import stdin
(friend_number, fence_height) = [int(x) for x in stdin.readline().rstrip().split()]
tall_friend_number = len([x for x in stdin.read().rstrip().split() if int(x) > fence_height])
print(friend_number + tall_friend_number)


def min_width(l, height):
	min_width = 0
	for i in range(len(l)):
		if l[i] <= height:
			min_width += 1
		else:
			min_width += 2
	return min_width
(n, h) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
print(min_width(a, h))


(n, h) = map(int, input().split())
hlist = list(map(int, input().split()))
width = 0
for ele in hlist:
	if ele > h:
		width += 2
	else:
		width += 1
print(width)


n = input()
n = n.strip().split()
for i in range(0, len(n)):
	n[i] = int(n[i])
l = input()
l = l.strip().split()
for i in range(0, len(l)):
	l[i] = int(l[i])
c = 0
for i in l:
	if i <= n[1]:
		c += 1
	else:
		c += 2
print(c)


(n, k) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
count = 0
for i in l:
	if i > k:
		count += 1
print(count + len(l))


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


(n, h) = map(int, input().split())
array1 = [int(x) for x in input().split()]
counter = 0
for x in array1:
	if x > h:
		counter += 2
	else:
		counter += 1
print(counter)


nh = input('')
(n, h) = nh.split(' ')
(n, h) = (int(n), int(h))
heights = input('')
heights = heights.split(' ')
count = 0
for i in range(0, n):
	if int(heights[i]) > h:
		count += 2
	else:
		count += 1
print(count)


(n, h) = map(int, input().split())
height = list(map(int, input().split()))
i = 0
width = 0
while i < n:
	if height[i] <= h:
		width += 1
	else:
		width += 2
	i += 1
print(width)


(n, h) = map(int, input().split())
val = map(int, input().split())
ans = 0
for v in val:
	ans += 1 + int(v > h)
print(ans)


I = [int(i) for i in input().split()]
F = [int(i) for i in input().split()]
width = 0
for i in range(I[0]):
	if F[i] > I[1]:
		width += 2
	if F[i] <= I[1]:
		width += 1
print(width)


(n, h) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
c1 = 0
c2 = 0
for i in range(n):
	if l[i] <= h:
		c1 += 1
	else:
		c2 += 1
print(c1 + 2 * c2)


v_vod = input().split()
n = int(v_vod[0])
h = int(v_vod[1])
a = [int(i) for i in input().split()]
result = 0
i = 0
while i <= len(a) - 1:
	if a[i] <= h:
		result += 1
	else:
		result += 2
	i += 1
print(result)


line1 = input()
(n, h) = line1.split(' ')
n = int(n)
h = int(h)
friends = input().split(' ')
width = len(friends) + len(list(filter(lambda x: int(x) > h, friends)))
print(width)


(n, fence) = [int(x) for x in input().split()]
height = [int(x) for x in input().split()]
count = 0
for i in range(n):
	if height[i] <= fence:
		count += 1
	elif height[i] / 2 <= fence:
		count += 2
print(count)


(T, limit) = map(int, input().split())
data = map(int, input().split())
result = sum([1 if i <= limit else 2 for i in data])
print(result)


import sys
data = sys.stdin.readlines()
first_row = data[0].strip()
second_row = data[1].strip()
first_list = first_row.split()
second_list = second_row.split()
limit = int(first_list[1])
point = 0
for item in second_list:
	if int(item) > limit:
		point += 2
	else:
		point += 1
print(point)


(n, h) = [int(x) for x in input().split()]
heights = [int(x) for x in input().split()]
length = 0
for i in heights:
	if i > h:
		length += 2
	else:
		length += 1
print(length)


(x, y) = map(int, input().split())
z = list(map(int, input().split()))
d = 0
e = 0
for i in z:
	c = i // y
	d += c + 1
for i in z:
	if i % y == 0:
		e += 1
print(d - e)


[n, h] = [int(_) for _ in input().split()]
lis = [int(_) for _ in input().split()]
ans = 0
for x in lis:
	if x <= h:
		ans += 1
	else:
		ans += 2
print(ans)


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


(n, h) = map(int, input().split())
g = []
d = 0
for i in range(n):
	a = map(int, input().split())
	g += a
	break
for u in g:
	if u > h:
		d += 2
	elif u <= h:
		d += 1
print(d)


L1 = input().split()
n = int(L1[0])
h = int(L1[1])
L = input().split()
L = [int(i) for i in L]
width = 0
for i in L:
	if i <= h:
		width += 1
	else:
		width += 2
print(width)


(n, h) = [int(i) for i in input().split()]
heights = [int(i) for i in input().split()]
bend = 0
for height in heights:
	if height > h:
		bend += 1
print(n + bend)


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


(n, h) = map(int, input().split())
width = 0
heights = input().split()
for i in heights:
	if int(i) > h:
		width += 1
print(n + width)


n = input()
a = input()
w = 0
sn = n.split(' ')
sa = a.split(' ')
for i in range(len(sa)):
	if int(sa[i]) <= int(sn[1]):
		w += 1
	else:
		w += 2
print(w)


import sys
n_height = input().split()
n = int(n_height[0])
h = int(n_height[1])
friends = input().split()
friends = [int(f) for f in friends]
width = 0
for i in friends:
	if i > h:
		width += 2
	else:
		width += 1
print(width)


(x, y) = [int(i) for i in input().split()]
lyst = list(map(int, input().split()))
print(len(lyst) + len([i for i in lyst if i > y]))


(n, h) = map(int, input().split())
hs = list(map(int, input().split()))[:n]
print(n + len(list(filter(lambda v: v > h, hs))))


(n, h) = [int(i) for i in input().split()]
height = [2 for i in input().split() if int(i) > h]
print(sum(height) + (n - len(height)))


values = input().split()
(people, limit) = (int(values[0]), int(values[1]))
heights = input().split()
counter = 0
for person in range(people):
	height = int(heights[person])
	if height > limit:
		counter += 2
	else:
		counter += 1
print(counter)


(n, height) = map(int, input().split())
heighl = list(map(int, input().split()))
count = 0
for i in range(n):
	if heighl[i] <= height:
		count += 1
	elif heighl[i] > height:
		count += 2
print(count)


(m, n) = map(int, input().split())
nums = list(map(int, input().split()))
total = []
for i in range(len(nums)):
	if nums[i] > n:
		total.append(2)
	else:
		total.append(1)
print(sum(total))


(a, b) = input().split()
c = input().split()
s = 0
for d in c:
	if int(d) > int(b):
		s += 2
	else:
		s += 1
print(s)


(nb_friends, height_fence) = [int(x) for x in input().split()]
height_friends = [int(x) for x in input().split()]
width = 0
for height in height_friends:
	if height > height_fence:
		width += 2
	else:
		width += 1
print(width)


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


(num, fence) = input().split()
num = int(num)
fence = int(fence)
cnt = 0
ppl = input().split()
for i in range(num):
	if fence < int(ppl[i]):
		cnt += 2
	else:
		cnt += 1
print(cnt)


a = list(map(int, input().split()))
x = list(map(int, input().split()))
count = 0
for i in x:
	if i > a[1]:
		count = count + 1
	count = count + 1
print(count)


(n, h) = map(int, input().split(' '))
li = list(map(int, input().split(' ')))
i = 0
ans = 0
while i < n:
	if li[i] > h:
		ans += 1
	ans += 1
	i += 1
print(ans)


import sys
import math as mt
t = 1
for __ in range(t):
	(n, h) = map(int, input().split())
	l = list(map(int, input().split()))
	ans = n
	for i in range(n):
		if l[i] > h:
			ans += 1
	print(ans)


nh = input().split()
n = int(nh[0])
h = int(nh[1])
persons = map(int, input().split())
road_width = 0
for person in persons:
	if person > h:
		road_width += 2
	else:
		road_width += 1
print(road_width)


(n, k) = map(int, input().split())
nums = list(map(int, input().split()))
width = 0
for i in nums:
	if i <= k:
		width += 1
	else:
		width += 2
print(width)


(n, h) = input().split()
y = input().split()
rows = int(n)
for a in y:
	if int(a) > int(h):
		rows += 1
print(rows)


l1 = input()
l1 = l1.split()
l2 = input()
l2 = l2.split()
out = 0
for i in range(int(l1[0])):
	if int(l2[i]) > int(l1[1]):
		out += 2
	else:
		out += 1
print(out)


(n, fence_height) = map(int, input().split())
list_a = []
height = list(map(int, input().strip().split()))[:n]
for i in height:
	if i > fence_height:
		list_a.append(2)
	elif i <= fence_height:
		list_a.append(1)
print(sum(list_a))


x = input().split()
y = input().split()
z = int(x[1])
output = 0
i = 0
while i < int(x[0]):
	if z >= int(y[i]):
		output += 1
	else:
		output += 2
	i += 1
print(output)


(n, h) = map(int, input().split())
height = list(map(int, input().split()))
print(n + len([i for i in height if i > h]))


width = 0
(n, h) = [int(a) for a in input().split()]
heights = [int(a) for a in input().split()]
for thing in heights:
	if thing <= h:
		width += 1
	else:
		width += 2
print(width)


(friends, height) = map(int, input().split(' '))
lst = list(map(int, input().split(' ')))
count = 0
for i in lst:
	if i > height:
		count += 1
	count += 1
print(count)


def compute_width(heights, h):
	width = len(heights)
	for ai in heights:
		if ai > h:
			width += 1
	return width
read = input().split(' ')
h = int(read[1])
heights = [int(i) for i in input().split(' ')]
print(compute_width(heights, h))


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


import sys
from sys import stdin, stdout
import bisect
from bisect import bisect_left as bl
from bisect import bisect_right as br
import itertools
from collections import Counter
import collections
import math
import heapq
import re

def modinv(n, p):
	return pow(n, p - 2, p)

def cin():
	return map(int, sin().split())

def ain():
	return list(map(int, sin().split()))

def sin():
	return input()

def inin():
	return int(input())

def Divisors(n):
	l = []
	for i in range(1, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def most_frequent(list):
	return max(set(list), key=list.count)

def GCD(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def ncr(n, r, p):
	t = fact[n] * (ifact[r] * ifact[n - r] % p) % p
	return t

def Convert(string):
	li = list(string.split(''))
	return li

def SieveOfEratosthenes(n):
	global prime
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	f = []
	for p in range(2, n):
		if prime[p]:
			f.append(p)
	return f
prime = []
q = []

def dfs(n, d, v, c):
	global q
	v[n] = 1
	x = d[n]
	q.append(n)
	j = c
	for i in x:
		if i not in v:
			f = dfs(i, d, v, c + 1)
			j = max(j, f)
	return j

def main():
	a1 = ain()
	a2 = ain()
	count = 0
	for i in range(a1[0]):
		if a2[i] > a1[1]:
			count += 1
	print(a1[0] + count)
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


(n, h) = map(int, input().split())
A = list(map(int, input().split()))
r = 0
for num in A:
	if num <= h:
		r += 1
	else:
		r += 2
print(r)


import time

def calculateWidthBasedHeight(h, anums):
	width = 0
	for x in anums:
		if x > h:
			width += 2
		else:
			width += 1
	return width

def solve():
	(nums, height) = [int(x) for x in input().split()]
	anums = [int(x) for x in input().split()]
	start_time = time.time()
	rwidth = calculateWidthBasedHeight(height, anums)
	print(rwidth)
solve()


def f(x, k):
	if x % k == 0:
		return x / k
	else:
		return x // k + 1
ans = 0
(n, k) = map(int, input().split())
a = input().split()
for _ in a:
	ans = ans + f(int(_), k)
print(int(ans))


def main():
	list1 = list(input().split())
	(n, h) = (int(list1[0]), int(list1[1]))
	list2 = list(input().split())
	weith = 0
	for m in range(n):
		if int(list2[m]) > h:
			weith += 2
		else:
			weith += 1
	print(weith)
main()


import sys
answer = 'NO'
parametrs = list(map(int, input().split()))
n = parametrs[0]
h = parametrs[1]
frends = list(map(int, input().split()))
width = 0
for frend in frends:
	if frend > h:
		width += 2
	else:
		width += 1
print(width)


(friends, f_height) = input().split()
friends = int(friends)
f_height = int(f_height)
width = 0
nums = input()
int_list = []
temp = ''
for letter in nums:
	if ord(letter) == 32:
		int_list.append(temp)
		temp = ''
	else:
		temp += letter
int_list.append(temp)
for person in int_list:
	if int(person) <= f_height:
		width += 1
	else:
		width += 2
print(width)


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


(m, h) = map(int, input().split())
l = list(map(int, input().split()))
s = 0
for i in l:
	if i <= h:
		s += 1
	else:
		s += 2
print(s)


cin = lambda : map(int, input().split())
(n, h) = cin()
a = list(cin())
for i in a:
	if i > h:
		n += 1
print(n)


import sys

def main(max_height, heights):
	return sum(map(lambda h: 1 if h <= max_height else 2, heights))
for (e, line) in enumerate(sys.stdin.readlines()):
	if e == 0:
		(_, height) = line.split()
		height = int(height)
	else:
		heights = list(map(int, line.split()))
print(main(height, heights))


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


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
c = 0
for i in range(n):
	if l[i] > h:
		c += 1
p = len(l) - c
print(2 * c + p)


import functools
import logging
import os
import sys
import time
from typing import List
logger = logging.getLogger()
reader = sys.stdin
is_judge = os.getenv('DEBUGGING') is None

def timeit(func):

	@functools.wraps(func)
	def timed(*args, **kwargs):
		if is_judge:
			rv = func(*args, **kwargs)
		else:
			ts = time.time()
			rv = func(*args, **kwargs)
			te = time.time()
			logger.debug('performance %r %2.2fms', func.__name__, (te - ts) * 1000)
		return rv
	return timed

def read_ints():
	return [int(v) for v in reader.readline().strip().split(' ')]

@timeit
def main():
	(n, h) = read_ints()
	a = read_ints()
	res = 0
	for i in range(n):
		if a[i] > h:
			res += 2
		else:
			res += 1
	print(res)

def setup():
	global logger, reader
	if is_judge:
		logger.setLevel(logging.WARNING)
	else:
		handler = logging.StreamHandler(sys.stdout)
		handler.setLevel(logging.DEBUG)
		formatter = logging.Formatter('{asctime}s - {message}', style='{')
		handler.setFormatter(formatter)
		logger.addHandler(handler)
		logger.setLevel(logging.DEBUG)
		reader = open('input.txt')
setup()
try:
	main()
except KeyboardInterrupt:
	logger.debug('KeyboardInterrupt')
except IOError as e:
	logger.error(f'I/O error({e.errno}): {e.strerror}')


n = input().split()
pole = [int(i) for i in input().split()]
pom = 0
for i in range(int(n[0])):
	if pole[i] > int(n[1]):
		pom += 2
	else:
		pom += 1
print(pom)


(n, m) = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
cont = 0
for k in l:
	if k % m != 0:
		cont += 1
	cont += k // m
print(cont)


import sys
input = sys.stdin.readline
(n, h) = map(int, input().split())
a = list(map(int, input().split()))
road = 0
for f in a:
	road += 1 if f <= h else 2
print(road)


(n, k) = map(int, input().split())
ans = 0
for x in map(int, input().split()):
	if x <= k:
		ans += 1
	else:
		ans += 2
print(ans)


(n, h) = input().split(' ')
hs = input().split(' ')
w = 0
for x in hs:
	if int(x) <= int(h):
		w += 1
		continue
	d = int(x)
	f = 1
	while d > int(h):
		d = d / 2
		w += 1 * f + 1
		f = 0
print(w)


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


(n, k) = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
width = 0
for h in arr:
	if h <= k:
		width = width + 1
	else:
		width = width + 2
print(width)


import math as m
l = list(map(int, input().split()))
a = list(map(int, input().split()))
n = l[0]
h = l[1]
pvw = 0
for e in a:
	pvw += m.ceil(e / h)
print(pvw)


(n, h) = map(int, input().split())
height_arr = map(int, input().split())
count = 0
for height in height_arr:
	if height > h:
		count += 2
	else:
		count += 1
print(count)


(n, h) = map(int, input().split())
friends = map(int, input().split())
m = 0
for friend in friends:
	if friend > h:
		m += 1
width = n + m
print(width)


(n, k) = map(int, input().split())
arr = [int(i) for i in input().split()]
c = 0
for i in range(len(arr)):
	if arr[i] <= k:
		c = c + 1
	else:
		c = c + 2
print(c)


(n, h) = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
a = n
for i in range(n):
	if p[i] > h:
		a += 1
	else:
		a = a
print(a)


def solve():
	inputs = list(map(int, input().split()))
	friends = inputs[0]
	h_fence = inputs[1]
	i = 0
	person_h = list(map(int, input().split()))
	for x in person_h:
		if x <= h_fence:
			i += 1
		else:
			i += 2
	print(i)
solve()


first_row = input()
first_row = first_row.split(' ')
number_of_friends = int(first_row[0])
fence_height = int(first_row[-1])
width = number_of_friends
friends_height = input()
friends_height = friends_height.split(' ')
for friend in friends_height:
	friend_height = int(friend)
	if friend_height > fence_height:
		width += 1
print(width)


init = input().split(' ')
frnds = int(init[0])
fnceht = int(init[1])
wdth = 0
hts = list(map(int, input().split(' ')))
for each in hts:
	if each <= fnceht:
		wdth += 1
	else:
		wdth += 2
print(wdth)


(friendAmount, fenceHeight) = map(int, input().split())
friendsHeights = list(map(int, input().split()))
roadWidth = 0
for height in friendsHeights:
	if height > fenceHeight:
		roadWidth += 2
	else:
		roadWidth += 1
print(roadWidth)


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


str = [int(i) for i in input().split()]
h = str[1]
str = [int(i) for i in input().split()]
spam = 0
for i in str:
	if h >= i:
		spam += 1
	else:
		spam += 2
print(spam)


(n, h) = map(int, input().split())
print(sum([*map(lambda x: x > h, map(int, input().split()))]) + n)


import re
in1 = input()
in2 = input()
nu = re.compile('\\d{4}|\\d{3}|\\d{2}|\\d')
n1 = nu.findall(in1)
n = int(n1[0])
h = int(n1[1])
n2 = nu.findall(in2)
count = n
for i in range(n):
	if int(n2[i]) > h:
		count = count + 1
print(count)


(n, h) = map(int, input().split())
inf = input().split()
answer = 0
for i in range(n):
	answer = answer + 1 if int(inf[i]) <= h else answer + 2
print(str(answer))


(x, y) = input().split(' ')
z = input().split(' ')
count = 0
for i in range(int(x)):
	if int(z[i]) > int(y):
		count += 2
	else:
		count += 1
print(count)


(f, H) = [int(x) for x in input().split()]
h = list(input().split())
w = 0
for i in range(f):
	if int(h[i]) > H:
		w = w + 2
	elif int(h[i]) <= H:
		w = w + 1
print(w)


(n, h) = input().split()
n = int(n)
h = int(h)
fr = [int(a) for a in input().split()]
s = 0
for i in range(n):
	if fr[i] > h:
		s += 2
	else:
		s += 1
print(s)


import sys
(N, H) = map(int, sys.stdin.readline().split())
f = 0
W = 0
for Ni in map(int, input().split()):
	if Ni > H:
		W = W + 2
	else:
		W = W + 1
	f = f + 1
print(W)


(a, b) = map(int, input().split())
I = input().split()
k = 0
for i in range(a):
	if int(I[i]) > b:
		k = k + 1
print(a + k)


def road_width(friends_height: list, fence_height: int) -> int:
	needed_road_width = 0
	for value in friends_height:
		if value > fence_height:
			needed_road_width += 2
		else:
			needed_road_width += 1
	return needed_road_width
usr_input = input().split(' ')
(n, fence_height_) = usr_input
friends_height_list = input().split(' ')
friends_height_list = [int(num) for num in friends_height_list]
print(road_width(friends_height_list, int(fence_height_)))


(numberOfFriends, fenceHeight) = [int(ip) for ip in input().split()]
heightOfFriends = [int(ip) for ip in input().split()]
widthOfRoad = 0
for height in heightOfFriends:
	if height > fenceHeight:
		widthOfRoad = widthOfRoad + 2
	else:
		widthOfRoad = widthOfRoad + 1
print(widthOfRoad)


(dr, zabor) = list(map(int, input().split()))
a = list(map(int, input().split()))
c = 0
for i in range(dr):
	if a[i] <= zabor:
		c = c + 1
	else:
		c = c + 2
print(c)


(n, h) = map(int, input().split())
lst = list(map(int, input().split()))
answer = 0
for num in lst:
	if num > h:
		answer += 2
		continue
	answer += 1
print(answer)


from __future__ import print_function
from __future__ import unicode_literals
from __future__ import division
from __future__ import absolute_import
import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect

def array2d(d1, d2, init=None):
	return [[init for _ in range(d1)] for _ in range(d2)]
(n, h) = map(int, input().split(' '))
al = map(int, input().split(' '))
total = n
for i in al:
	if i > h:
		total += 1
print(total)


(numFriends, fence) = map(int, input().split())
heights = list(map(int, input().split()))
widths = 0
for x in heights:
	if x <= fence:
		widths += 1
	else:
		widths += 2
print(widths)


inf = list(map(int, input().split()))
arr = list(map(int, input().split()))
x = 0
for i in arr:
	if i > inf[1]:
		x += 1
print(inf[0] + x)


one = []
one.append(input().split())
new_one = []
for i in one[0]:
	new_one.append(int(i))
two = []
two.append(input().split())
new_two = []
for j in two[0]:
	new_two.append(int(j))
width = 0
for k in new_two:
	if k > new_one[1]:
		width += 2
	else:
		width += 1
print(width)


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest, _heapify_max, _heapreplace_max
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as c
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from fractions import Fraction
mod = pow(10, 9) + 7
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
(n, h) = sp()
arr = l()
answer = 0
for i in arr:
	if i > h:
		answer += 2
	else:
		answer += 1
out(answer)


from collections import Counter

def check(n, h, a):
	c = 0
	for h1 in a:
		if h1 > h:
			c += 2
		else:
			c += 1
	return c
[n, h] = map(int, input().split())
a = [int(i) for i in input().split()]
print(check(n, h, a))


(n, h) = [int(x) for x in input().split()]
heights = [int(x) for x in input().split()]
count = 0
for height in heights:
	if height > h:
		count += 1
print(n + count)


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


minWidth = 0
(n, h) = [int(x) for x in input().split()]
heightList = [int(x) for x in input().split()]
for x in heightList:
	y = 1 if x <= h else 2
	minWidth += y
print(minWidth)


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


(num_of_friens, fence_height) = map(int, input().split())
friends = list(map(int, input().split()))
road_width = 0
for person in friends:
	if person > fence_height:
		road_width += 2
	else:
		road_width += 1
print(road_width)


(n, k) = [int(i) for i in input().split()]
arr = [int(i) for i in input().split()]
res = 0
for i in arr:
	if i > k:
		res += 2
	elif i <= k:
		res += 1
print(res)


cont = 0
(n, k) = list(map(int, input().split()))
lista = list(map(int, input().split()))
for x in lista:
	if x > k:
		cont += 2
	else:
		cont += 1
print(cont)


(t, h) = map(int, input().split())
width = list()
freinds = list(map(int, input().split()))
for n in freinds:
	if n > h:
		width.append(2)
	else:
		width.append(1)
print(sum(width))


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


a = input().split()
n = int(a[0])
h = int(a[1])
f = input().split()
c = 0
for i in range(len(f)):
	if int(f[i]) <= h:
		c += 1
	elif int(f[i]) > h:
		c += 2
print(c)


s = input()
a = s.split()
for i in range(len(a)):
	a[i] = int(a[i])
s = input()
b = s.split()
for i in range(len(b)):
	b[i] = int(b[i])
sum = 0
i = 0
while i < len(b):
	if b[i] <= a[1]:
		sum += 1
	else:
		sum += 2
	i += 1
print(sum)


n = [int(x) for x in input().split()]
data = [int(x) for x in input().split()]
print(sum([2 for x in data if x > n[1]]) + sum([1 for x in data if x <= n[1]]))


nandh = list(map(int, input().split()))
ai = list(map(int, input().split()))
i = 0
summ = 0
while i < nandh[0]:
	if ai[i] <= nandh[1]:
		summ += 1
	else:
		summ += 2
	i += 1
print(summ)


(n, h) = [int(i) for i in input().split()]
heights = [int(i) for i in input().split()]
numbers = 0
for i in range(n):
	if heights[i] <= h:
		numbers += 1
	else:
		numbers += 2
print(numbers)


import math
(n, h) = map(int, input().split())
d = 0
l = list(map(int, input().split()))
for i in range(n):
	if l[i] <= h:
		d = d + 1
	else:
		d = d + math.ceil(l[i] / h)
print(d)


w = []
(n, h) = input().split(' ')
if 1 <= int(n) <= 1000 and 1 <= int(h) <= 1000:
	x = input().split(' ')
	for i in x:
		if int(i) > int(h):
			w.append(2)
		else:
			w.append(1)
	width_of_the_road = sum(w)
	print(width_of_the_road)
else:
	raise ValueError('Enter Valid Numbers')


from collections import deque, Counter, OrderedDict
from heapq import nsmallest, nlargest
from math import ceil, floor, log, log2, sqrt, gcd, factorial

def binNumber(n, size=4):
	return bin(n)[2:].zfill(size)

def iar():
	return list(map(int, input().split()))

def ini():
	return int(input())

def isp():
	return map(int, input().split())

def sti():
	return str(input())

def par(a):
	return ' '.join(list(map(str, a)))

class pair:

	def __init__(self, f, s):
		self.fi = f
		self.se = s

	def __lt__(self, other):
		return (self.fi, self.se) < (other.fi, other.se)
(n, h) = isp()
a = iar()
s = 0
for i in a:
	if i <= h:
		s += 1
	else:
		s += 2
print(s)


(n, h) = map(int, input().split(' '))
arr = list(map(int, input().split()))
sm = 0
for a in arr:
	if a <= h:
		sm += 1
	elif a > h:
		sm += 2
print(sm)


(n, m) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
tall = 0
for i in range(n):
	if a[i] > m:
		tall += 1
width = tall + n
print(width)


(m, n) = map(int, input().split())
l = list(map(int, input().split()))
k = list(filter(lambda x: x > n, l))
l = list(filter(lambda x: x <= n, l))
print(len(l) + 2 * len(k))


def problem():
	s = input()
	v = s.split(' ')
	n = int(v[0])
	h = int(v[1])
	count = 0
	ss = input()
	vv = ss.split(' ')
	for i in range(n):
		pos = int(vv[i])
		i += 1
		if pos > h:
			count += 2
		else:
			count += 1
	return count
print(problem())


(n, h) = map(int, input().split())
f = n
tab = list(map(int, input().split()))
for x in range(n):
	if tab[x] > h:
		f += 1
print(f)


a = input().split()
s = input().split()
t = 0
for i in range(0, int(a[0])):
	if int(s[i]) > int(a[1]):
		t += 1
print(int(a[0]) + t)


set_n = list(input().split())
n = int(set_n[1])
people = list(input().split())
counter = 0
for element in people:
	if int(element) > n:
		counter += 2
	else:
		counter += 1
print(counter)


(friends_amount, fence_height) = map(int, input().split())
all_friends_height = list(map(int, input().split(' ')))
road_weight = 0
for per_person in all_friends_height:
	if per_person > fence_height:
		road_weight += 2
	else:
		road_weight += 1
print(road_weight)


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


h = int(str(input()).split()[1])
arr = str(input()).split()
width = 0
for i in arr:
	if int(i) <= h:
		width += 1
	else:
		width += 2
print(width)


friends_and_height = input().split(' ')
height = int(friends_and_height[1])
heights = input().split(' ')
total_width = 0
for friend_height in heights:
	if int(friend_height) > height:
		total_width += 2
	else:
		total_width += 1
print(total_width)


(x, y) = [int(x) for x in input().split()]
i = 0
a = 0
z = [int(z) for z in input().split()]
while i < x:
	if z[i] > y:
		a += 2
	else:
		a += 1
	i += 1
print(a)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
from bisect import bisect_right as r
k = r(a, h)
print(k + (n - k) * 2)


(_, h) = input().split()
y = input().split()
rows = 0
for a in y:
	a = int(a)
	while a > 0:
		rows += 1
		a -= int(h)
print(rows)


(a, b) = input().split()
lis = [int(x) for x in input().split()]
n = 0
for i in range(int(a)):
	if lis[i] > int(b):
		n += 1
print(int(a) + n)


s1 = input()
(n, h) = s1.split()
n = int(n)
h = int(h)
s2 = input()
s = s2.split()
sum = 0
for i in range(n):
	if int(s[i]) > h:
		s[i] = 2
	else:
		s[i] = 1
	sum = sum + s[i]
print(sum)


def check(n, h, a, mid):
	cnt = 0
	for i in range(n):
		cnt += a[i] > h
	return n - cnt + cnt * 2 <= mid

def bins(n, h, a):
	(l, r) = (0, 2 * n + 1)
	while r - l > 1:
		mid = (l + r) // 2
		if check(n, h, a, mid):
			r = mid
		else:
			l = mid
	return r
(n, h) = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
print(bins(n, h, a))


(x, y) = map(int, input().split())
t = list(map(int, input().split()))
cpt = 0
for e in t:
	cpt = cpt + 1 if e <= y else cpt + 2
print(cpt)


a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
(i, o) = (0, 0)
while i < len(b):
	if b[i] <= a[1]:
		i += 1
		o += 1
	else:
		i += 1
		o += 2
print(o)


(n, fence_height) = map(int, input().split())
friends_height = list(map(int, input().split()))
chk1 = list(filter(lambda x: x > fence_height, friends_height))
chk2 = list(filter(lambda x: x <= fence_height, friends_height))
print(2 * len(chk1) + len(chk2))


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


(number, hight) = input().split()
len = input().split()
print(sum((int(i) > int(hight) for i in len)) + int(number))


x = lambda : map(int, input().split())
a = list(x())
b = list(x())
print(a[0] + sum((s > a[1] for s in b)))


(n, h) = map(int, input().split())
if n >= 1 and n <= 1000 and (h >= 1) and (h <= 1000):
	a = list(map(int, input().split()))
	check = 1
	width = 0
	for item in a:
		if item < 1 or item > 2 * h:
			check = 0
			break
	if len(a) == n and check == 1:
		for item in a:
			if item <= h:
				width += 1
			else:
				width += 2
		print(width)


lst1 = list(map(int, input().strip().split(' ')))
lst2 = list(map(int, input().strip().split(' ')))
c = 0
for i in lst2:
	if i <= lst1[1]:
		c += 1
	else:
		c += 2
print(c)


(n, h) = input().split()
nn = int(n)
hh = int(h)
x = [int(x) for x in input().split()]
ans = 0
for i in x:
	if i <= hh:
		ans += 1
	elif i / 2 <= hh:
		ans += 2
print(ans)


(n, heightOfFence) = map(int, input().split())
totalHeight = 0
print(n + sum([int(i) > heightOfFence for i in input().split()]))


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
s = 0
for i in l:
	if i % m == 0:
		s += i // m
	else:
		s += i // m + 1
print(s)


(n, h) = [int(x) for x in input().split(' ')]
p = [int(x) for x in input().split(' ')]
print(n + sum((i > h for i in p)))


fence_height = int(input().split()[1])
friends_height = list(map(int, input().split()))
width = 0
for ht in friends_height:
	width += 1
	if ht > fence_height:
		width += 1
print(width)


def min_poss():
	(a, b) = input().strip(' ').split(' ')
	b = int(b)
	sum = 0
	w_person = input().strip(' ').split(' ')
	for i in range(len(w_person)):
		if int(w_person[i]) <= b:
			sum += 1
		elif int(w_person[i]) >= b:
			sum += 2
	print(sum)
min_poss()


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


inf = list(map(int, str(input()).split(' ')))
p = list(map(int, str(input()).split(' ')))
w = 0
for h in p:
	if h <= inf[1]:
		w += 1
	else:
		w += 2
print(w)


(n, h) = map(int, input().split(' '))
List = [int(j) for j in input().split(' ')] * n
List_1 = []
for i in range(n):
	if List[i] <= h:
		List_1.append(1)
	else:
		List_1.append(2)
print(sum(List_1))


(n, m) = [int(i) for i in input().split()]
for i in input().split():
	i = int(i)
	if i > m:
		n += 1
print(n)


a = list(map(int, input().split()))
b = list(map(int, input().split()))
(k, p) = a
x = 0
for i in b:
	if i > p:
		x += 2
	else:
		x += 1
print(x)


(N, H) = map(int, input().split())
A = list(map(int, input().split()))
cnt = 0
for i in range(0, N):
	if A[i] > H:
		cnt += 2
	else:
		cnt += 1
print(cnt)


def solve():
	(N, H) = map(int, input().split())
	A = list(map(int, input().split()))
	ans = 0
	for h in A:
		if h > H:
			ans += 2
		else:
			ans += 1
	print(ans)
solve()


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
m = 0
j = 0
sum = 0
for i in a:
	if i % h == 0:
		m += i // h
	else:
		j += i // h + 1
	sum = m + j
print(sum)


l1 = input()
l2 = input()
n_h = l1.split()
per_h = l2.split()
result = 0
for i in range(int(n_h[0])):
	if int(per_h[i]) <= int(n_h[1]):
		result += 1
	else:
		result += 2
print(result)


(n, h) = input().split(' ')
l = list(input().split(' '))
total = 0
for i in l:
	if int(i) > int(h):
		total += 1
	total += 1
print(total)


line1 = input()
(n, h) = line1.split(' ')
n = int(n)
h = int(h)
width = 0
friends = input().split(' ')
for friend in friends:
	width += 1
	if int(friend) > h:
		width += 1
print(width)


(n, h) = map(int, input().split())
mas = [int(x) for x in input().split()]
mas1 = []
x = 0
for i in mas:
	if i > h:
		mas1.insert(x, 2)
	else:
		mas1.insert(x, 1)
	x += 1
print(sum(mas1))


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


(num, height) = [int(x) for x in input().split()]
list_height = [int(x) for x in input().split()]
width = 0
for i in list_height:
	if i > height:
		width += 2
	else:
		width += 1
print(width)


(n, h) = input().split()
n = int(n)
h = int(h)
alist = list(map(int, input().split()))
sumi = 0
for item in alist:
	if item > h:
		sumi += 2
	else:
		sumi += 1
print(sumi)


def bend(n, h, heights):
	count = 0
	for i in heights:
		if i > h:
			count += 1
		count += 1
	return count
(n, k) = map(int, input().split())
heights = list(map(int, input().split()))
print(bend(n, k, heights))


try:
	(n, h) = list(map(int, input().split()))
	l = list(map(int, input().split()))
	cnt = 0
	for i in l:
		if i > h:
			cnt += 1
	res = 2 * cnt + n - cnt
	print(res)
except:
	pass


(n, b) = map(int, input().split())
s = 0
for i in input().split():
	if int(i) > b:
		s += 2
	else:
		s += 1
print(s)


inp1 = list(map(int, input().rstrip().split()))
inp2 = list(map(int, input().rstrip().split()))
c = 0
for i in inp2:
	if i > inp1[1]:
		c += 2
	else:
		c += 1
print(c)


import sys
input = sys.stdin.readline
home = []
away = []
n = [int(x) for x in input().split()]
h = n[1]
n = n[0]
arr = [int(x) for x in input().split()]
counter = 0
for i in range(0, n):
	if arr[i] > h:
		counter += 2
	else:
		counter += 1
print(counter)


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


(n, h) = list(map(int, input().split()))
arr = list(map(int, input().split()))
cnt = 0
x = 0
y = 0
for i in arr:
	if h >= i:
		x = x + 1
	if h < i:
		y = y + 2
	cnt = cnt + 1
z = x + y
print(z)


(n, h) = map(int, input().split())
s = map(int, input().split())
a = []
for k in s:
	a.append(k)
c = 0
for i in range(0, n):
	if a[i] > h:
		c = c + 2
	else:
		c = c + 1
print(c)


(friends, height) = map(int, input().split())
nums = map(int, input().split())
numsArray = list(nums)
for i in range(friends):
	if numsArray[i - 1] > height:
		friends += 1
print(friends)


import sys
input = sys.stdin.readline

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


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


import math
(n, h) = map(int, input().split())
s = input().split()
count = 0
for i in range(len(s)):
	count += math.ceil(int(s[i]) / h)
print(count)


n = input().split(' ')
s = input().split(' ')
z = 0
for i in s:
	if int(i) > int(n[1]):
		z += 2
	else:
		z += 1
print(z)


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


entrada = str(input())
entrada = entrada.split()
n = int(entrada[0])
h = int(entrada[1])
friends = str(input())
friends = friends.split()
suma = n
for x in friends:
	if int(x) > h:
		suma += 1
print(suma)


import math
(n, h) = list(map(int, input().strip().split(' ')))
ls = list(map(int, input().strip().split(' ')))
count = 0
for i in ls:
	if i > h:
		count += 2
	else:
		count += 1
print(count)


(a, b) = map(int, input().split())
c = sorted(list(map(int, input().split())))
if c[-1] <= b:
	print(a)
else:
	for i in range(a):
		if c[i] > b:
			break
	print(i + 2 * (a - i))


(n, height) = map(int, input().split())
heights = sorted(list(map(int, input().split())))[::-1]
ans = -1
for i in range(n):
	if heights[i] <= height:
		ans = i
		break
print(ans + n if ans != -1 else 2 * n)


(n, h) = [int(x) for x in input().split(' ')]
heights = [int(y) for y in input().split(' ')]
count = 0
for i in heights:
	if i > h:
		count = count + 1
width = n - count + count * 2
print(width)


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
h = []
for i in c:
	if i > b:
		h.append(2)
	elif i <= b:
		h.append(1)
print(sum(h))


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


import os
import sys
from io import BytesIO, IOBase

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().strip().split(' '))

def li():
	return list(mi())

def main():
	(n, h) = mi()
	arr = li()
	res = 0
	for i in range(n):
		if arr[i] > h:
			res += 2
		else:
			res += 1
	print(res)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


inp = [0, 0]
ind = 0
ans = 0
str_ = input()
for dig in str_:
	if dig != ' ':
		inp[ind] = 10 * inp[ind] + int(dig)
	elif dig == ' ':
		ind += 1
str_ = input()
num = 0
for (i, dig) in enumerate(str_):
	if dig != ' ':
		num = 10 * num + int(dig)
	if dig == ' ' or i == len(str_) - 1:
		if num > inp[1]:
			ans += 2
		elif num <= inp[1]:
			ans += 1
		num = 0
print(ans)


w = input().split()
p = input().split()
t = 0
for i in range(0, len(p)):
	if int(p[i]) > int(w[1]):
		t = t + 1
print(int(len(p) + t))


(a, b) = input('').split()
x = list(map(int, input('').split()))
c = 0
i = 0
while i < int(a):
	if x[i] <= int(b):
		c += 1
		i += 1
	else:
		c += 2
		i += 1
print(c)


def answer():
	a = input().split()
	(n, h) = (int(a[0]), int(a[1]))
	b = input().split()
	ans = n
	for x in b:
		if int(x) > h:
			ans += 1
	return ans
print(answer())


(no_of_kids, fence_height) = [int(i) for i in input().split(' ')]
sequence = [int(i) for i in input().split(' ')]
width = no_of_kids
for height in sequence:
	if height > fence_height:
		width += 1
print(width)


(n, k) = map(int, input().split())
l = list(map(int, input().rstrip().split()))
m = len(l)
c1 = 0
c2 = 0
for i in range(0, m):
	if l[i] > k:
		c1 += 2
	if l[i] <= k:
		c2 += 1
print(c1 + c2)


(N, k) = map(int, input().split())
arr = list(map(int, input().split()))
cnt = len(arr)
for x in arr:
	if x > k:
		cnt += 1
print(cnt)


(n, fence_height) = map(int, input().split())
width = 0
per_height = [int(x) for x in input().split()]
for val in per_height:
	if val > fence_height:
		width += 2
	else:
		width += 1
print(width)


b = input().split()
n = int(b[0])
h = int(b[1])
a = [int(x) for x in input().split()]
br = 0
for i in range(0, len(a)):
	br += 1
	if a[i] > h:
		br += 1
print(br)


(n, h) = list(map(int, input().split()))
a = list(map(int, input().split()))
x = []
for i in range(n):
	if a[i] > h:
		x.append(2)
	elif a[i] <= h:
		c = 1
		x.append(1)
print(sum(x))


s = input().split()
n = int(s[0])
h = int(s[1])
friends = input().split()
count = 0
for i in friends:
	count += 1
	if int(i) > h:
		count += 1
print(count)


e = 0
p = 0
(x, y) = [int(t) for t in input().split()]
if x >= 1 and x <= 1000 and (y >= 1) and (y <= 1000):
	q = [int(t) for t in input().split()]
	if len(q) == x:
		for r in q:
			if 1 <= r <= 2 * y:
				if r <= y:
					e = e + 1
				else:
					p = p + 2
		print(p + e)


(l, m) = map(int, input().split())
x = input()
a = []
for y in x.split():
	a.append(y)
i = 0
for f in a:
	if int(f) > m:
		i += 2
	else:
		i += 1
print(i)


(n, h) = map(int, input().split())
a = [int(n) for n in input().split()]
width = 0
if 1 <= n <= 1000 and 1 <= h <= 1000:
	for i in range(len(a)):
		if a[i] > h and 1 <= a[i] <= 2 * h:
			width += 2
		else:
			width += 1
	print(width)


import math

def get_num():
	return list(map(int, input().rstrip().split()))

def rotate(list, num):
	return list[num:] + list[:num]

def main():
	list1 = get_num()
	list2 = get_num()
	answer = 0
	for person in list2:
		if person > list1[1]:
			answer += 2
		else:
			answer += 1
	print(answer)
main()


n = input().split()
ls = input().split()
count = 0
for items in ls:
	if int(items) <= int(n[1]):
		count += 1
	else:
		count += 2
print(count)


(n, l) = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
s = 0
for i in arr:
	if i <= l:
		s += 1
	else:
		s += 2
print(s)


string = input()
string += ' '
list = []
str = ''
for i in string:
	if i == ' ':
		list.append(int(str))
		str = ''
	else:
		str += i
num_of_hight_string = input()
nums = num_of_hight_string.split(' ')
count = len(nums)
for i in range(count):
	nums[i] = int(nums[i])
if list[0] == count:
	sum = 0
	for i in nums:
		if i <= list[1]:
			sum += 1
		elif i % list[1] == 0:
			sum += i // list[1]
		else:
			sum += i // list[1] + 1
print(sum)


(n, h) = map(int, input().strip().split())
width = 0
for k in map(int, input().strip().split()):
	width += 1 if k <= h else 2
print(width)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
e = 0
for i in l:
	if i > h:
		e += 1
print(len(l) + e)


(a, b) = map(int, input().split())
c = [int(x) for x in input().split()]
d = 0
for y in c:
	if y > b:
		d += 1
print(a + d)


(n, v) = map(int, input().split())
m = list(map(int, input().split()))
c = len(m)
for i in range(n):
	if m[i] > v:
		c += 1
print(c)


(a, b) = map(int, input().split())
L1 = map(int, input().split())
sum = 0
for i in L1:
	if i <= b:
		sum += 1
	else:
		sum += 2
print(sum)


(a, b) = map(int, input().split())
s = ''
x = 0
y = 0
fuck = 0
l = list(map(int, input().split()))
for i in l:
	if i <= b:
		x += 1
	if i > b:
		y += 1
for i in range(1, x + 1, 1):
	fuck += 1
for i in range(1, y + 1, 1):
	fuck += 2
print(fuck)


(n, h) = map(int, input().split())
Line = [int(i) for i in input().split()]
k = 0
for i in range(n):
	if Line[i] > h:
		k += 1
m = n + k
print(m)


heightFriends = []
dist = 0
(n, h) = input().split()
heightFriends = input().split()
for height in heightFriends:
	if int(height) > int(h):
		dist += 2
	else:
		dist += 1
print(dist)


n = input().split()
x = input().split()
f = int(n[0])
h = int(n[1])
cnt = 0
for i in range(0, f):
	if int(x[i]) > h:
		cnt += 2
	else:
		cnt += 1
print(cnt)


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


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


import sys
RI = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('Yes')

def NO():
	print('No')
INF = 10 ** 18
MOD = 10 ** 9 + 7
(n, k) = RI()
a = RI()
cnt = 0
for i in a:
	if i <= k:
		cnt += 1
	else:
		cnt += 2
print(cnt)


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


(n, h) = map(int, input().split())
l = []
m = []
a_1 = input().split()
c = a_1
for t in range(len(a_1)):
	a_1[t] = int(a_1[t])
n -= 1
for i in range(int(len(c))):
	i = c[0]
	if i > h:
		m.append(2)
	elif i < h:
		m.append(1)
	elif i == h:
		m.append(1)
	del c[0]
print(sum(m))


(n, m) = map(int, input().split())
array = list(map(int, input().split()))
count = 0
for num in array:
	if num > m:
		count += 2
	else:
		count += 1
print(count)


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


var = [int(x) for x in input().split()]
hei = [int(y) for y in input().split()]
wid = 0
for i in range(var[0]):
	if hei[i] > var[1]:
		wid += 2
	else:
		wid += 1
print(wid)


def main():
	(n, h) = tuple(map(int, input().rstrip().split()))
	A = tuple(map(int, input().rstrip().split()))
	ans = sum((1 if i <= h else 2 for i in A))
	print(ans)
main()


num = list(map(int, input().strip().split()))[:2]
heightArray = list(map(int, input().strip().split()))[:num[0]]
hMax = num[1]
count = 0
for i in range(len(heightArray)):
	if heightArray[i] <= hMax:
		count += 1
	else:
		count += 2
print(count)


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


from functools import reduce

def read_ints():
	return [int(elem) for elem in input().split(' ')]

def read_input():
	(number_friends_input, height_fence_input) = read_ints()
	height_list_input = read_ints()
	return (number_friends_input, height_fence_input, height_list_input)
(number_of_friends, fence_height, height_list) = read_input()
print(reduce(lambda p1, p2: p1 + p2, list(map(lambda x: 1 if x.__le__(fence_height) else 2, height_list))))


(n1, h1) = input().split()
n = int(n1)
h = int(h1)
sum = 0
for i in range(1):
	a = [int(j) for j in input().split()]
for i in range(n):
	if a[i] > h:
		sum += 2
	else:
		sum += 1
print(sum)


str1 = input()
L1 = str1.split(' ')
h = L1[1]
str2 = input()
L2 = str2.split(' ')
width = 0
for number in L2:
	if int(number) > int(h):
		width += 2
	else:
		width += 1
print(width)


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


nh = input().split()
valuse = input().split()
counter = 0
for x in range(int(nh[0])):
	if int(valuse[x]) > int(nh[1]):
		counter += 2
	else:
		counter += 1
print(counter)


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


import sys
line1 = input()
line2 = input()
(number_of_person, height_of_fence) = line1.split()
height_of_person = line2.split()
width = 0
for person in height_of_person:
	if int(person) <= int(height_of_fence):
		width += 1
	else:
		width += 2
print(width)


x = input().split()
a = input().split()
i = 0
sum = 0
while i < int(x[0]):
	sum += 1
	if int(a[i]) > int(x[1]):
		sum += 1
	i += 1
print(sum)


(n, h) = input().split()
h = int(h)
n = int(n)
count = 0
lheight = [int(i) for i in input().split()]
for i in range(n):
	if lheight[i] > h:
		count += 1
print(count * 2 + n - count)


persons_and_fence = list(map(int, input().split()))
person_heights = list(map(int, input().split()))
needed_width = 0
for i in person_heights:
	if i > persons_and_fence[1]:
		needed_width += 2
	else:
		needed_width += 1
print(needed_width)


(a, b) = map(int, input().split())
arr = list(map(int, input().split()))
res = 0
for i in range(len(arr)):
	if arr[i] > b:
		res += 1
res += a
print(res)


(n, h) = input().split()
a = input().split()
s = 0
for ai in a:
	if int(ai) <= int(h):
		s = s + 1
	else:
		s = s + 2
print(s)


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def main():
	(n, h) = LI()
	a = LI()
	r = 0
	for c in a:
		if c > h:
			r += 2
		else:
			r += 1
	return r
print(main())


(n, f_h) = map(int, input().split())
p_h = list()
p_h = [int(item) for item in input().split()]
w_r = n
for i in range(0, n):
	w_r = w_r + 1 if p_h[i] > f_h else w_r
print(w_r)


from sys import stdin as Si, maxsize as m
from math import floor as F
from collections import defaultdict as dt
from operator import itemgetter as ig
from math import pi
(n, h) = map(int, Si.readline().split())
A = list(map(int, Si.readline().split()))
print(sum([2 if i > h else 1 for i in A]))


(x, y) = map(int, input().split())
inp = list(map(int, input().split()))
frnds = inp[:x]
count = 0
for i in frnds:
	if i <= y:
		count += 1
	else:
		count += 2
print(count)


output = 0
(n, h) = map(int, input().split())
list1 = list(map(int, input().split()))
for items in list1:
	if items == h:
		output += 1
	elif items // h + 1 == 2 or items / h == 2:
		output += 2
	else:
		output += 1
print(output)


z = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for i in x:
	if i <= z[1]:
		ans.append(1)
	else:
		ans.append(2)
print(sum(ans))


from typing import List, Tuple

def parse_input() -> Tuple[int, int, List[int]]:
	(n, h) = [int(x) for x in input().split()]
	arr = [int(x) for x in input().split()]
	return (n, h, arr)

def solve(n: int, h: int, arr: List[int]) -> int:
	width = 0
	for x in arr:
		if x <= h:
			width += 1
		else:
			width += 2
	return width
(n, h, arr) = parse_input()
print(solve(n, h, arr))


first_line = [int(x) for x in input().split()]
n = first_line[0]
h = first_line[1]
second_line = [int(x) for x in input().split()]
mayores = list(filter(lambda x: x > h, second_line))
result = n + len(mayores)
print(result)


test = input()
len_input = test.split()[0]
height = int(test.split()[1])
arr = input().split()
arr_list = list(map(int, arr))
weight = 0
for x in arr_list:
	if x <= height:
		weight += 1
	elif x > height:
		weight += 2
print(weight)


(n, h) = [int(x) for x in input().split()]
ai = [int(x) for x in input().split()]
length = n
for i in range(n):
	if ai[i] > h:
		length += 1
print(length)


a = input().split()
n = int(a[0])
h = int(a[1])
w = 0
f = input().split()
for i in range(n):
	f[i] = int(f[i])
	if f[i] > h:
		w += 2
	else:
		w += 1
print(w)


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


(n, l) = input().split(' ')
nbr = input().split(' ')
s = 0
for i in nbr:
	if int(i) > int(l):
		s = s + 2
	else:
		s = s + 1
print(s)


n_h = list(map(int, input().split()))
a = list(map(int, input().split()))
total = 0
for i in a:
	if i <= n_h[1]:
		total += 1
	else:
		total += 2
print(total)


(friends, height_of_fence) = [int(x) for x in input().split(' ')]
height_of_friends = [int(x) for x in input().split(' ')]
width_required = 0
for friend in height_of_friends:
	if friend <= height_of_fence:
		width_required += 1
	else:
		width_required += 2
print(width_required)


(n, h) = input().split()
nn = int(n)
hh = int(h)
person_hight = [int(x) for x in input().split()]
temp = 0
for y in person_hight:
	if y > hh:
		width = 2
		temp += width
	else:
		width = 1
		temp += width
print(temp)


z = input().split()
(n, f) = (int(z[0]), int(z[1]))
h = [int(x) for x in input().split()]
temp = [2 if j > f else 1 for j in h]
print(sum(temp))


import math
(n, h) = map(int, input().split())
sum = 0
x = [int(i) for i in input().split()]
for i in x:
	sum += math.ceil(i / h)
print(sum)


(n, h) = map(int, input().split())
friends = map(int, input().split())
res = 0
for friend in friends:
	if friend <= h:
		res += 1
	else:
		res += 2
print(res)


(n, h) = input().split()
l = list(map(int, input().split()))
k = []
for i in range(len(l)):
	if l[i] <= int(h):
		k.append(l[i])
print(len(k) + 2 * (len(l) - len(k)))


(n, k) = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
cnt = 0
for i in l:
	if i <= k:
		cnt += 1
	else:
		cnt += 2
print(cnt)


(n, h) = map(int, input().split())
res = 0
p = [int(x) for x in input().split()]
for el in p:
	if el > h:
		res += 2
	else:
		res += 1
print(res)


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


(a, b) = input().split()
a = int(a, 10)
b = int(b, 10)
s = input().split()
s1 = list(s)
w = 0
for i in range(a):
	k1 = int(s1[i], 10)
	k = int(k1 / b)
	if k * b == k1:
		w = w + k
	else:
		w = w + (k + 1)
print(w)


import sys

def minp():
	return sys.stdin.readline().strip()
r = 0
(n, h) = map(int, minp().split())
for i in map(int, minp().split()):
	if i > h:
		r += 2
	else:
		r += 1
print(r)


(n, k) = map(int, input().split(' '))
list1 = list(map(int, input().split(' ')))
sum1 = 0
for j in list1:
	sum1 += 2 if j > k else 1
print(sum1)


(n, h) = map(int, input().split())
s = [int(s) for s in input().split()]
c = 0
for i in range(n):
	if s[i] > h:
		c += 1
print(n + c)


list1 = input().split()
list2 = input().split()
n = int(list1[0])
h = int(list1[1])
width = 0
for i in range(n):
	width += 1
	if int(list2[i]) > h:
		width += 1
print(width)


(n, p) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
b = [1 for i in range(len(a)) if a[i] <= p]
print(sum(b) + 2 * (n - len(b)))


aux = input()
aux = aux.split(' ')
n = int(aux[0])
h = int(aux[1])
ans = 0
aux = input()
aux = aux.split(' ')
for i in range(n):
	if int(aux[i]) <= h:
		ans = ans + 1
	else:
		ans = ans + 2
print(ans)


(x, y) = map(int, input().split())
s = list(map(int, input().split()))
c = 0
for i in s:
	if i > y:
		c = c + 2
	else:
		c = c + 1
print(c)


k = list(map(int, input().strip().split()))
l = list(map(int, input().strip().split()))
count = 0
for i in range(k[0]):
	if l[i] <= k[1]:
		count += 1
	else:
		count += 2
print(count)


(a, b) = map(int, input().split())
k = a
L = list(map(int, input().split()))
for i in range(len(L)):
	if L[i] > b:
		k += 1
print(k)


ar = [int(num) for num in input().split()]
h = ar[1]
a = 0
arr = [int(num) for num in input().split()]
for i in arr:
	if i > h:
		a += 2
	else:
		a += 1
print(a)


a = list(map(int, input().split()))
b = list(map(int, input().split()))
k = int(0)
x = int(0)
while x < a[0]:
	if b[x] > a[1]:
		k = k + 2
	else:
		k = k + 1
	x = x + 1
print(k)


(digit, hight) = map(int, input().split())
yui = []
yui = input().split()
p = 0
for i in range(0, digit):
	if int(yui[i]) > hight:
		p += 2
	if int(yui[i]) <= hight:
		p += 1
print(p)


(n, h) = map(int, input().split())
arr = list(map(int, input().split()))
width = 0
for values in arr:
	if values > h:
		width += 2
	elif values <= h:
		width += 1
print(width)


(num, fence) = list(map(int, input().split()))
guys = list(map(int, input().split()))
print(num + sum([1 if i > fence else 0 for i in guys]))


def main():
	max_lim = int(input().split()[1])
	nums = map(int, input().split())
	print(sum([1 if x <= max_lim else 2 for x in nums]))
main()


(num, h) = map(int, input().split())
lst = [0 for i in input().split() if int(i) > h]
print(len(lst) + num)


(numOfFrnd, heightFence) = list(map(int, input().split()))
minWidth = 0
for val in list(map(int, input().split())):
	if val > heightFence:
		minWidth += 2
	else:
		minWidth += 1
print(minWidth)


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


import sys

def read_arr(dtype=int):
	return [dtype(c) for c in sys.stdin.readline().strip().split()]
(n, h) = read_arr()
heights = read_arr()
print(sum((1 if a <= h else 2 for a in heights)))


n = list(map(int, input().split()))
friend = list(map(int, input().split()))
a = 0
for i in friend:
	if i <= n[1]:
		a += 1
	else:
		a += 2
print(a)


def main():
	(n, h) = map(int, input().split())
	print(n + sum((x > h for x in map(int, input().split()))))
main()


from collections import defaultdict

def solve(n, h, x):
	wide = 0
	for i in x:
		if i > h:
			wide += 2
		else:
			wide += 1
	return wide
(n, h) = tuple(map(int, input().split()))
x = list(map(int, input().split()))
print(solve(n, h, x))


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


from sys import stdin, stdout

def sin():
	return stdin.readline().rstrip()

def listInput():
	return list(map(int, sin().split()))

def printBS(li):
	if not li:
		return
	for i in range(len(li) - 1):
		stdout.write('%d ' % li[i])
	stdout.write('%d\n' % li[-1])
(n, k) = listInput()
li = listInput()
ans = n
for i in li:
	if i > k:
		ans += 1
print(ans)


(n, h) = map(int, input().split())
a = [int(x) for x in input().split()]
bend = 0
for i in a:
	if i > h:
		bend += 1
ans = n - bend + bend * 2
print(ans)


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


list1 = input().split(' ')
n = int(list1[0])
h = int(list1[1])
list2 = input().split(' ')
w = 0
for i in range(0, n):
	if int(list2[i]) > h:
		w += 2
	else:
		w += 1
print(w)


(n, h) = str(input()).split()
n = int(n)
h = int(h)
line = str(input()).split()
value = 0
for it in line:
	if int(it) > h:
		value += 2
	else:
		value += 1
print(value)


(nh, kh) = map(int, input().split())
lh = list(map(int, input().split()))
ch = 0
for i in range(nh):
	if lh[i] > kh:
		ch = ch + 2
	else:
		ch = ch + 1
print(ch)


(n, h) = map(int, input().split())
nums = [int(x) for x in input().split()]
less = sum([1 for x in nums if x > h])
print(less * 2 + (n - less))


def main():
	width = 0
	(num_of_friends, height) = map(int, input().split())
	n = map(int, input().split())
	for i in range(num_of_friends):
		if n.__next__() > height:
			width += 2
		else:
			width += 1
	print(width)
main()


i = lambda : [*map(int, input().split())]
(n, h) = i()
arr = i()
result = 0
for x in arr:
	result += 1
	if x > h:
		result += 1
print(result)


(n, h) = map(int, input().split())
if n >= 1 and n <= 1000 and (h >= 1) and (h <= 1000):
	l = []
	c = n
	l = list(map(int, input().split(' ')))
	for i in range(n):
		if l[i] > h:
			c = c + 1
	print(c)


from functools import reduce

def min_width_of_road(arr, h, n):
	extra_width = reduce(lambda count, current: count + (1 if current > h else 0), arr, 0)
	return n + extra_width
(n, h) = map(int, input().split())
arr = map(int, input().split())
print(min_width_of_road(arr, h, n))


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


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


first = list(map(int, input().split()))
nums = first[0]
heighOfFence = first[1]
second = list(map(int, input().split()))
res = 0
for x in second:
	if x > heighOfFence:
		res = res + 2
	else:
		res = res + 1
print(res)


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


var = list(map(int, input().split()))
people = list(map(int, input().split()))
output = 0
for i in people:
	if i > var[1]:
		output = output + 2
	else:
		output = output + 1
print(output)


def main():
	(n, hight) = map(int, input().split())
	friends = list(map(int, input().split()))
	ctr = 0
	for i in friends:
		if i <= hight:
			ctr += 1
		else:
			ctr += 2
	print(ctr)
main()


(x, y) = [int(x) for x in input('').split()]
ar = list(map(int, input().strip().split(' ')))
count = 0
for z in ar:
	if z > y:
		count = count + 1
print(2 * count + (x - count))


(n, h) = map(int, input().split())
more_h = [int(x) for x in input().split() if int(x) > h]
print(n + len(more_h))


(n, m) = list(map(int, input().split()))
person = list(map(int, input().split()))
road = 0
for boy in person:
	if boy <= m:
		road += 1
	else:
		road += 2
print(road)


(n, h) = [int(el) for el in input().split(' ')]
a = input().split(' ')
res = 0
for el in a:
	if int(el) > h:
		res += 2
	else:
		res += 1
print(res)


(a, b) = [int(x) for x in input().split()]
height = [int(x) for x in input().split()]
for i in range(a):
	if height[i] > b:
		a += 1
print(a)


from typing import List

def solve(*, _input: List[int], max_height: int) -> int:
	return sum([1 if height <= max_height else 2 for height in _input])
(friends_number, fence_height) = map(int, input().split())
solution = solve(_input=list(map(int, input().split())), max_height=fence_height)
print(solution)


s = input()
try:
	n = int(s.split(' ')[0])
	h = int(s.split(' ')[1])
except Exception:
	n = 0
	h = 0
width = 0
w = input()
walkers_length = w.split(' ')
for i in walkers_length:
	if int(i) > h:
		width += 2
	else:
		width += 1
print(width)


(a, b) = input().split()
c = int(a)
couner = 0
list1 = [int(h) for h in input().split()]
for i in list1:
	if i > int(b):
		couner += 2
	else:
		couner += 1
print(couner)


a = input()
b = input()
list1 = a.split(' ')
list2 = b.split(' ')
n = int(list1[0])
k = int(list1[1])
i = 0
n1 = n
while i < n:
	c = int(list2[i])
	if c > k:
		n1 += 1
	i += 1
else:
	print(n1)


def counta(lis, limit):
	count = 0
	for item in lis:
		if item > limit:
			count += 2
		else:
			count += 1
	return count
(n, h) = map(int, input().split())
lis = [int(x) for x in input().split()]
print(counta(lis, h))


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


(count_friends, high_fence) = map(int, input().split())
high_friends = list(map(int, input().split()))
total = 0
length = len(high_friends)
for friend in range(length):
	if high_friends[friend] <= high_fence:
		total += 1
	else:
		total += 2
print(total)


def solve():
	(n_friends, height) = map(int, input().split())
	friends = list(map(int, input().split()))
	width = 0
	for friend in friends:
		if friend > height:
			width += 2
		else:
			width += 1
	print(width)
solve()


(n, h) = map(int, input().strip().split())
y = list(map(int, input().split()))
c = 0
for a in range(n):
	if y[a] > h:
		c = c + 2
	else:
		c = c + 1
print(c)


import atexit, io, sys
import math
import os
import random
import re
from sys import stdin, stdout
from collections import Counter
from itertools import permutations
sys.setrecursionlimit(3000)

def si():
	return str(stdin.readline())

def ii():
	return int(stdin.readline())

def mi():
	return map(int, stdin.readline().split())

def li():
	return list(mi())

def debug(x):
	return stdout.write(str(x))
(n, h) = mi()
a = li()
c = 0
for i in range(n):
	if a[i] > h:
		c += 1
debug(n - c + c * 2)


a = [int(x) for x in input('').split(' ')]
s = [int(x) for x in input('').split(' ')]
(n, h) = (a[0], a[1])
i = 0
for j in s:
	if j > h:
		i += 1
print(i * 2 + n - i)


(n, h) = input().split()
s = list((int(num) for num in input().strip().split()))[:int(n)]
count = 0
for i in s:
	count += 1
	if i > int(h):
		count += 1
print(count)


def VanyaAndfriends():
	(n, h) = map(int, input().strip().split())
	width = n
	heights = map(int, input().strip().split())
	for i in heights:
		if i > h:
			width += 1
	return width
a = VanyaAndfriends()
print(a)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
ns = sum((1 for i in a if i > h))
print(n + ns)


(n, k) = map(int, input().split())
l = [int(x) for x in input().split()]
w = 0
for i in l:
	if i > k:
		w += 2
	else:
		w += 1
print(w)


c = 0
(n, m) = map(int, input().split())
k = list(map(int, input().split()))
for t in k:
	if t > m:
		c = c + 2
	else:
		c = c + 1
print(c)


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
s = 0
for _ in range(len(a)):
	if a[_] > k:
		s += 1
print(s * 2 + n - s)


(__, n) = map(int, input().split())
s = 0
for i in map(int, input().split()):
	if i > n:
		s += 2
	elif i <= n:
		s += 1
print(s)


def read_nums():
	return [int(x) for x in input().split()]

def main():
	(n, h) = read_nums()
	nums = read_nums()
	print(len(nums) + len([x for x in nums if x > h]))
main()


(friends_count, fence_height) = list(map(int, input().split()))
friends_width = 0
friends_hieght = list(map(int, input().split()))
for n in range(friends_count):
	friend_hieght = friends_hieght[n]
	if friend_hieght <= fence_height:
		friends_width = friends_width + 1
	else:
		friends_width = friends_width + 2
print(friends_width)


import math
(n, mh) = [int(x) for x in input().strip().split(' ')]
h = [int(x) for x in input().strip().split(' ')]
count = 0
temp = 0
for i in range(len(h)):
	if h[i] > mh:
		temp = math.ceil(h[i] / mh)
		count = count + temp
	else:
		count = count + 1
print(count)


(n, h) = list(map(int, input().strip().split(' ')))
a = list(map(int, input().strip().split(' ')))
width = 1
res = []
for i in a:
	if i > h:
		width = 2
	else:
		width = 1
	res.append(width)
print(sum(res))


(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]))


(x, y) = map(int, input().split())
m = 0
n = 0
heights = [int(x) for x in input().split()]
for height in heights:
	if height > y:
		m = m + 2
	else:
		n = n + 1
o = m + n
print(o)


n1 = input()
arr = n1.split()
word = int(arr[0])
s1 = int(arr[1])
t2 = input()
fr = t2.split()
total = 0
for i in fr:
	g = int(i)
	if g > s1:
		total += 2
	else:
		total += 1
print(total)


(x, y) = map(int, input().split())
counter = 0
array = list(map(int, input().split()))
for i in range(0, x):
	if array[i] > y:
		counter += 2
	else:
		counter += 1
print(counter)


import sys, math
import fileinput
(x, y) = map(int, input().split())
result = 0
score = [int(x) for x in input().split()]
for item in score:
	if item <= y:
		result += 1
	else:
		result += 2
print(result)


(n, b) = input().split()
(n, b) = (int(n), int(b))
a = [int(i) for i in input().split()]
for j in range(n):
	if a[j] > b:
		n += 1
print(n)


val = list(map(int, input().split()))
que = list(map(int, input().split()))
road = 0
for i in range(val[0]):
	if que[i] > val[1]:
		road += 2
	else:
		road += 1
print(road)


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


v = list(map(int, input().split()))
array = list(map(int, input().split()))
h = v[1]
min_width = 0
for x in array:
	if x > h:
		min_width += 2
	else:
		min_width += 1
print(min_width)


(number_of_friends, height_of_fence) = [int(i) for i in input().split()]
heights_of_friends = [int(i) for i in input().split()]
output = 0
for i in range(number_of_friends):
	if heights_of_friends[i] > height_of_fence:
		output += 2
	else:
		output += 1
print(output)


def count(h, A):
	sum = 0
	for i in A:
		if i > h:
			sum = sum + 2
		else:
			sum = sum + 1
	return sum
f_line = [int(x) for x in input().split()]
s_line = [int(x) for x in input().split()]
print(count(f_line[1], s_line))


data1 = input()
arr2 = [int(x) for x in input().split()]
arr1 = [int(x) for x in data1.split()]
total = 0
for item in arr2:
	if item / arr1[1] > 1:
		total += 2
	else:
		total += 1
print(total)


(n, h) = list(map(int, input().split()))
ai = map(int, input().split())
min_width = 0
for height in ai:
	if height > h:
		min_width += 2
	else:
		min_width += 1
print(min_width)


def bublesort(a):
	n = len(a)
	fl1 = False
	while not fl1:
		fl1 = True
		for i in range(n - 1):
			if a[i] > a[i + 1]:
				(a[i], a[i + 1]) = (a[i + 1], a[i])
				fl1 = False

def isgood(a):
	k = 0
	for x in a:
		if x == 'a':
			k += 1
	return k > len(a) // 2

def dell(a):
	k = 0
	for x in a:
		if x != 'a':
			return a[:k] + a[k + 1:]
		k += 1

def pl2d(a):
	for t in a:
		for x in t:
			print(x, end=' ')
		print()

def foundm(x, a, row, col):
	for i in range(row):
		for j in range(col):
			if a[i][j] == x:
				return (i, j)

def swaprow(a, n1, n2):
	(a[n1], a[n2]) = (a[n2], a[n1])

def swapcol(a, k1, k2):
	for lst in a:
		swaprow(lst, k1, k2)

def prlist(a):
	for x in a:
		print(x, end=' ')
(n, h) = list(map(int, input().split()))
a = list(map(int, input().split()))
w = 0
for i in range(n):
	if a[i] > h:
		w += 2
	else:
		w += 1
print(w)


(n, h) = map(int, input().split())
a = sorted(map(int, input().split()))
i = 0
while i != n:
	if a[i] > h:
		print(i + (n - i) * 2)
		quit()
	i += 1
print(n)


aux = input().split(' ')
n = int(aux[0])
h = int(aux[1])
hFriends = input().split(' ')
width = 0
for i in hFriends:
	if int(i) > h:
		width += 2
	else:
		width += 1
print(width)


def solve(n, h, lst):
	count = 0
	for ele in lst:
		if ele > h:
			count += 2
		else:
			count += 1
	return count
(n, h) = map(int, input().split(' '))
lst = map(int, input().split(' '))
print(solve(n, h, lst))


def solution(h, height):
	total = 0
	for elem in height:
		if elem > h:
			total += 2
		else:
			total += 1
	return total

def main():
	(n, h) = input().split(' ')
	height = list(map(int, input().split(' ')))
	print(solution(int(h), height))
main()


nb = 0
(a, b) = (int(x) for x in input().split())
l = list((int(x) for x in input().split()))
for i in l:
	if i <= b:
		nb += 1
	else:
		nb += 2
print(nb)


mysoul = list(map(int, input().split()))
lol = list(map(int, input().split()))
width = 0
for i in range(0, mysoul[0]):
	if lol[i] > mysoul[1]:
		width += 2
	if lol[i] <= mysoul[1]:
		width += 1
print(width)


(n, h) = map(int, input().split())
l = list(map(int, input().split()))
s = 1
p = []
for i in l:
	if i > h:
		p.append(s + 1)
	else:
		p.append(s)
print(sum(p))


(n_friends, h_fence) = list(map(int, input().split()))
friends_h = list(map(int, input().split()))
counter = 0
for x in range(n_friends):
	if friends_h[x] > h_fence:
		counter += 2
	else:
		counter += 1
print(counter)


inp1 = input().split()
inp2 = input().split()
x = 0
inp1[1] = int(inp1[1])
for num in inp2:
	if int(num) > inp1[1]:
		x += 2
	else:
		x += 1
print(x)


from sys import stdin, stdout
input = stdin.readline

def write(n, sep='\n'):
	stdout.write(str(n))
	stdout.write(sep)

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


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


(total_friend, height_fence) = map(int, input().split())
hei = list(map(int, input().split()))
wi = 0
for j in range(total_friend):
	if hei[j] <= height_fence:
		wi += 1
	else:
		wi += 2
print(wi)


(n, h) = [int(s) for s in input().split()]
width = 0
h_s = [int(s) for s in input().split()]
for ele in h_s:
	if ele > h:
		width += 2
	else:
		width += 1
print(width)


def minimum_width(height, people):
	minimum_width = 0
	for person in people:
		if person > height:
			minimum_width += 2
		else:
			minimum_width += 1
	return minimum_width

def main():
	(n, h) = map(int, input().split())
	people = list(map(int, input().split()))
	print(minimum_width(h, people))
main()


from sys import stdin, stdout
(n, h) = map(int, stdin.readline().split())
arr = list(map(int, stdin.readline().split()))
width = 0
for num in arr:
	if num > h:
		width += 2
	else:
		width += 1
print(width)


l = list(map(int, input().split()))
m = list(map(int, input().split()))
f = l[1]
i = 0
w = 0
while i < len(m):
	if m[i] < f or m[i] == f:
		w += 1
	else:
		w += 2
	i += 1
print(w)


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


sum = 0
(n, k) = input().split()
(n, k) = (int(n), int(k))
array = list(input().split())
array = [int(x) for x in array]
for i in array:
	if i > k:
		sum += 2
	else:
		sum += 1
print(sum)


(n, h) = map(int, input().split())
output = n
for a in [int(x) for x in input().split()]:
	if a > h:
		output = output + 1
print(output)


firstline = input().split(' ')
secondline = input().split(' ')
count = 0
for p in secondline:
	if int(p) > int(firstline[1]):
		count += 2
	else:
		count += 1
print(count)


from functools import reduce
(n, h) = map(int, input().split())
a = map(int, input().split())
print(n + reduce(lambda acc, x: acc + int(x > h), a, 0))


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


(x, y) = map(int, input().split())
lis = list(map(int, input().split()))[:x]
ct = 0
for i in lis:
	if i <= y:
		ct += 1
	else:
		ct += 2
print(ct)


def passage(a, b):
	people = a[0]
	maxi = a[1]
	totalLen = 0
	for i in range(people):
		if b[i] <= maxi:
			totalLen += 1
		else:
			totalLen += 2
	return totalLen
params = list(map(int, input().split()))
specs = list(map(int, input().split()))
print(passage(params, specs))


c = 0
s1 = input().split()
s2 = input().split()
for i in range(int(s1[0])):
	if int(s2[i]) <= int(s1[1]):
		c += 1
	elif int(s2[i]) > int(s1[1]):
		if int(s2[i]) % int(s1[1]) != 0:
			c += int(s2[i]) // int(s1[1]) + 1
		else:
			c += int(s2[i]) // int(s1[1])
print(c)


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


(no, fence) = input().split()
fence = int(fence)
double = single = 0
ph = list(input().split())
for each in range(len(ph)):
	ph[each] = int(ph[each])
for each in range(len(ph)):
	if ph[each] > fence:
		double += 1
	else:
		single += 1
width = double * 2 + single * 1
print(width)


n = list(str(input()).split())
x = list(str(input()).split())
w = 0
for i in range(len(n)):
	n[i] = int(n[i])
for i in range(len(x)):
	x[i] = int(x[i])
for i in x:
	if i > n[1]:
		wid = 2
	else:
		wid = 1
	w = wid + w
print(w)


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


(n1, h1) = input().split()
n = int(n1)
h = int(h1)
count = 0
p = input().split()
for i in p:
	if int(i) <= h:
		count = count + 1
	if int(i) > h:
		count = count + 2
print(count)


(n, h) = map(int, input().split())
h_list = list(map(int, input().split()))
print(sum([[1, 2][i > h] for i in h_list]))


from sys import stdin, stdout
(num, height) = map(int, input().split())
list_height = [int(i) for i in stdin.readline().split()]
width = num
for i in list_height:
	if i > height:
		width += 1
stdout.write(str(width))


a = input().split()
b = input().split()
d = int(a[0])
for i in range(int(a[0])):
	if int(b[i]) > int(a[1]):
		d += 1
print(d)


num = input().split()
n = num[0]
h = num[1]
heights = input().split()
total = 0
for x in heights:
	if int(x) > int(h):
		total += 2
	else:
		total += 1
print(total)


inp1 = input().split()
n = int(inp1[0])
h = int(inp1[1])
inp = input().split()
arr = []
count = 0
for i in inp:
	arr.append(int(i))
for i in range(len(arr)):
	if arr[i] <= h:
		count = count + 1
	else:
		count = count + 2
print(count)


(x, y) = list(map(int, input().split()))
n = 0
l = [int(i) for i in input().split()]
for i in l:
	if i > y:
		n += 2
	elif i <= y:
		n += 1
print(n)


count = 0
heights = []
s = input()
r1 = s.split(' ')
n = r1[0]
h = r1[1]
n = int(n)
h = int(h)
s2 = input()
r2 = s2.split(' ')
for i in range(n):
	temp = int(r2[i])
	heights.append(temp)
for i in range(len(heights)):
	if heights[i] > h:
		count = count + 2
	else:
		count = count + 1
print(count)


x = int(input().split()[1])
y = [int(z) for z in input().split()]
su = 0
for n in y:
	if n > x:
		su += 2
	else:
		su += 1
print(su)


from sys import stdin
input = stdin.readline
(a, b) = map(int, input().split())
person = list(map(int, input().split()))
total = 0
for i in range(a):
	if b < person[i]:
		total += 2
	else:
		total += 1
print(total)


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


(n, k) = map(int, input().split())
a = map(int, input().split())
ans = 0
for i in a:
	ans += 1
	if i > k:
		ans += 1
print(ans)


s = input().split()
n = int(s[0])
h = int(s[1])
str1 = input().split()
lst = []
for i in str1:
	if int(i) > h:
		lst.append(2)
	else:
		lst.append(1)
print(sum(lst))


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


def turn_int(x):
	y = int(x)
	return y
(n, h) = input('').split(' ')
n = int(n)
h = int(h)
a = 0
s = input('').split(' ')
for i in s:
	i = turn_int(i)
	if i > h:
		a = a + 1
	else:
		a = a
print(n + a)


(n, h) = [int(s) for s in input().split(' ')]
a = [int(s) for s in input().split(' ')]
print(n + len([s for s in a if s > h]))


(n, h) = map(int, input().split(' '))
lst = list(map(int, input().split(' ')))
c = 0
for e in lst:
	if e > h:
		c += 2
	else:
		c += 1
print(c)


def strToInt(sl):
	lis = []
	for s in sl:
		lis.append(int(s))
	return lis
(N, H) = input().split()
n = int(N)
h = int(H)
min_road = 0
friends = list(input().split())
friends = strToInt(friends)
for f in friends:
	if f <= h:
		min_road += 1
	else:
		min_road += 2
print(min_road)


(n, h) = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
for i in a:
	if i > h:
		n += 1
print(n)


(x, y) = map(int, input().split())
a = list(map(int, input().strip().split()))[:x]

def get_width(a, y):
	sum = len(a)
	for i in a:
		if i > y and i <= 2 * y:
			sum += 1
	return sum
t = get_width(a, y)
print(t)


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


def min_wid(n, h):
	friends = [int(x) for x in input().split()]
	tally = 0
	for person in friends:
		if person > h:
			tally += 2
		else:
			tally += 1
	return tally

def main():
	(n, h) = [int(x) for x in input().split()]
	print(min_wid(n, h))
main()


def hi(h, l):
	w = 0
	for i in range(0, len(l)):
		if l[i] <= h:
			w += 1
		else:
			w += 2
	return w
(n, h) = map(int, input().split())
l = list(map(int, input().split()))
print(hi(h, l))


l = lambda : map(int, input().split())
(n, h) = l()
print(sum([(i > h) + 1 for i in [*l()]]))


(no_of_people, height_of_wall) = list(map(int, input().split()))
width = 0
for each_person_height in list(map(int, input().split())):
	if each_person_height > height_of_wall:
		width += 2
	else:
		width += 1
print(width)


(n, h) = map(int, input().split())
a = map(int, input().split())
ans = 0
for aH in a:
	ans += (aH > h) + 1
print(ans)


l = input().split(' ')
n = int(l[0])
h = int(l[1])
r = input().split(' ')
c = n
for i in range(n):
	if int(r[i]) > h:
		c += 1
print(c)


li1 = list(map(int, input().split(' ')))
li2 = list(map(int, input().split(' ')))
width = 0
for i in li2:
	if i > li1[1]:
		width += 2
	else:
		width += 1
print(width)


(n, h) = map(int, input().split())
a = map(int, input().split())
result = 0
for ai in a:
	result += (ai > h) + 1
print(result)


x = list(map(int, input().split()))
y = list(map(int, input().split()))
count = 0
if len(y) != x[0]:
	print('Error')
else:
	for elem in y:
		if elem > x[1]:
			count += 2
		else:
			count += 1
print(count)


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


(n, m) = map(int, input().split())
ar = list(map(int, input().split()))
min_fench = 0
for val in ar:
	if val <= m:
		min_fench += 1
	else:
		min_fench += 2
print(min_fench)


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


(nof, maxh) = [int(x) for x in input().split()]
friends = [int(x) for x in input().split()]
width = 0
for i in friends:
	width += [2, 1][i <= maxh]
print(width)


while True:
	try:
		(n, h) = map(int, input().split())
		a = [0] * (n + 1)
		a[1:] = map(int, input().split())
		width = 0
		for frnd in range(1, n + 1, 1):
			if a[frnd] > h:
				width += 2
			else:
				width += 1
		print(width)
	except EOFError:
		break


(n, h) = input().split(' ')
(n, h) = (int(n), int(h))
prm = 0
A = input().split(' ')
A = [int(A[i]) for i in range(n)]
for i in A:
	if i > h:
		prm += 2
	else:
		prm += 1
print(prm)


(number_of_people, height_of_fence) = [int(i) for i in input().split()]
width = 0
height_of_people = [int(i) for i in input().split()]
for i in range(len(height_of_people)):
	if height_of_people[i] <= height_of_fence:
		width += 1
	else:
		width += 2
print(width)


import sys
(n, h) = map(int, input().split())
f = [int(i) for i in input().split()]
counter = 0
for j in f:
	if j > h:
		counter += 2
	else:
		counter += 1
print(counter)


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
cmt = sum((2 if i > b else 1 for i in c))
print(cmt)


from sys import stdin, stdout
(n, heightLimit) = map(int, stdin.readline().split())
heights = [int(i) for i in stdin.readline().split()]
width = 0
for height in heights:
	if height > heightLimit:
		width += 2
	else:
		width += 1
stdout.write(str(width))


(n, h) = list(map(int, input().split()))
stu = list(map(int, input().split()))
tend = [el for el in stu if el > h]
if len(tend) > 0:
	sol = (len(stu) - len(tend)) * 1 + len(tend) * 2
	print(sol)
else:
	print(len(stu))


(n, k) = map(int, input().split())
num = [int(i) for i in input().split()]
w = n
for i in range(n):
	if num[i] > k:
		w += 1
print(w)


in1 = input('').split()
in2 = input('').split()
h = int(in1[1])
min_w = 0
for i in in2:
	if int(i) > h:
		min_w += 2
	else:
		min_w += 1
print(min_w)


from collections import defaultdict as dd
import sys
input = sys.stdin.readline
(n, h) = map(int, input().split())
l = list(map(int, input().split()))
cou = 0
for i in l:
	if i > h:
		cou += 2
	else:
		cou += 1
print(cou)


(n, h) = (int(i) for i in input().split())
res = sum(((int(x) > h) + 1 for x in input().split()))
print(res)


l = input().split()
l = [int(x) for x in l]
n = l[0]
h = l[1]
ch = input().split()
ch = [int(x) for x in ch]
nb = 0
for e in ch:
	if e <= h:
		nb += 1
	else:
		nb += 2
print(nb)


(n, m) = list(map(int, input().split()))
people = list(map(int, input().split()))
sum = 0
for person in people:
	if person <= m:
		sum += 1
	else:
		sum += 2
print(sum)


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


(n, h) = map(int, input().split(' '))
a = list(map(int, input().split()))
w1 = sum((1 for item in a if item <= h))
w2 = sum((2 for item in a if item > h))
print(w1 + w2)


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


nhStr = input()
n = int(nhStr.split()[0])
h = int(nhStr.split()[1])
aStr = input()
aS = aStr.split()
width = 0
for i in range(n):
	if int(aS[i]) <= h:
		width = width + 1
	else:
		width = width + 2
print(width)


inp = input('').split()
n = int(inp[0])
h = int(inp[1])
str = input('').split()
count = 0
for i in str:
	if int(i) > h:
		count += 2
	else:
		count += 1
print(count)


(n, h) = [int(x) for x in input().split(' ')]
a = [int(x) for x in input().split(' ')]
min = n
for p in a:
	if p > h:
		min += 1
print(min)


import math
(n, h) = map(int, input().split())
l = [math.ceil(int(i) / h) for i in input().split()]
print(sum(l))


(n, h) = map(int, input().split())
a = list(input().split())
for i in range(len(a)):
	a[i] = int(a[i])
width = 1
res = 0
for i in range(len(a)):
	if a[i] <= h:
		width = 1
	else:
		while a[i] > h:
			width += 1
			a[i] = a[i] - h
	res += width
	width = 1
print(res)


def minimumRoadWidth(n, h, a):
	width = 0
	for height in a:
		if height > h:
			width += 2
		else:
			width += 1
	return width
(n, h) = input().split()
(n, h) = (int(n), int(h))
a = input().split()
a = (int(x) for x in a)
print(minimumRoadWidth(n, h, a))


(n, t) = map(int, input().split(' '))
m = input()
h = list(map(int, m.split()))
l = []
for i in range(0, n):
	if h[i] > t:
		k = 2
		l.append(k)
	else:
		p = 1
		l.append(p)
print(sum(l))


(num_people, fence_height) = input().split()
people_heights = input().split()
num_double = 0
for height in people_heights:
	height = int(height)
	if height > int(fence_height):
		num_double += 1
width = int(num_people) + int(num_double)
print(width)


try:
	(n, h) = input().split()
	n = int(n)
	h = int(h)
	s = input()
	arr = s.split()
	ans = 0
	for i in arr:
		if int(i) > h:
			ans += 2
		else:
			ans += 1
	print(ans)
except:
	pass


import re
(n, h) = map(int, input().split())
hei = [int(i) for i in re.findall('\\d+\\s', input() + ' ')]
width = 0
for i in hei:
	if i > h:
		width += 2
	else:
		width += 1
print(width)


import sys
import math
from os import path
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
(n, h) = map(int, input().split())
l = list(map(int, input().split()))
width = 0
for i in l:
	if i <= h:
		width += 1
	elif i > h:
		width += 2
print(width)