# cook your dish here
for j in range(int(input())):
n,k=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
c=0
i=0
j=1
while c==0:
if min(l[i],l[j])>k:
l[i]=l[i]-1
l[j]=l[j]-1
else:
i+=1
j+=1
if j>n-1:
break
print(sum(l))
# your code goes here
IyBjb29rIHlvdXIgZGlzaCBoZXJlCmZvciBqIGluIHJhbmdlKGludChpbnB1dCgpKSk6CiAgICBuLGs9bWFwKGludCxpbnB1dCgpLnNwbGl0KCkpCiAgICBsPWxpc3QobWFwKGludCxpbnB1dCgpLnNwbGl0KCkpKQogICAgbC5zb3J0KCkKICAgIGM9MAogICAgaT0wCiAgICBqPTEKICAgIHdoaWxlIGM9PTA6CiAgICAgICAgaWYgbWluKGxbaV0sbFtqXSk+azoKICAgICAgICAgICAgbFtpXT1sW2ldLTEKICAgICAgICAgICAgbFtqXT1sW2pdLTEKICAgICAgICBlbHNlOgogICAgICAgICAgICBpKz0xCiAgICAgICAgICAgIGorPTEKICAgICAgICAgICAgaWYgaj5uLTE6CiAgICAgICAgICAgICAgICBicmVhawogICAgcHJpbnQoc3VtKGwpKQogICAgICAgICMgeW91ciBjb2RlIGdvZXMgaGVyZQ==