import heapq 
from heapq import heappop,heappush,heapify
from sys import stdin, setrecursionlimit
input = stdin.readline
readline = stdin.readline
T=int(input())
from collections import deque
d=deque()

for _ in range(T):
  N,X=map(int, input().split())
  C=list(map(int, input().split()))
  d=deque()
  d.append((X,0))
  for i in range(N):
    D={};c=C[i]
    while d:
      now,s=d.popleft()
      if now&(1<<c):
        if now not in D:
          D[now]=s 
        else:
          D[now]=min(D[now],s)
      else:
        p=((now>>c)<<c)-1
        q=((now>>c)+1)<<c 
        if p>0:
          if p not in D:
            D[p]=s+abs(now-p)
          else:
            D[p]=min(D[p],s+abs(now-p))
        if q not in D:
          D[q]=s+abs(now-q)
        else:
          D[q]=min(D[q],s+abs(now-q))
    for dd in D:
      d.append((dd,D[dd]))

  ans=10**22
  for d in D:
    c=D[d]+abs(X-d)
    ans=min(ans,c)
  print(ans)