#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

ll solve() {
    int N;
    ll X;
    cin >> N >> X;
    vector<int> C;
    for (int i = 0, x; i < N; i++) {
        int c;
        cin >> c;
        if (int x = X >> c & 1; !x) {
            C.push_back(c);
        }
    }
    N = C.size();

    if (N == 0) {
        return 0;
    }

    int t = C.back();
    ll ans = INFL;

    // 大きい方向に買いに行く Xより大きい、t bitが立っているような最小の整数
    // goal/(2^t)=奇数
    {
        ll goal = (X / (1ll << t) + 1) * (1ll << t);
        ans = min(ans, (goal - X) * 2);
    }
    // 小さい方向
    // goal/(2^t)=奇数,(goal+1)/(2^t)=偶数
    if (X / (1ll << t) > 0) {
        ll goal = (X / (1ll << t)) * (1ll << t) - 1;
        ans = min(ans, (X - goal) * 2);
    }

    return ans;
}

int main() {
    int T;
    cin >> T;

    while (T--) {
        cout << solve() << endl;
    }
}