#pragma region template

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr ll inf = 3001001000100100100LL;
#define endl '\n'

#define rep(i, n) for (ll i = 0; i < (n); ++i)

template <class T, class U>
bool chmin(T& m, const U& v) {
    if (v < m) {
        m = v;
        return true;
    }
    return false;
}
template <class T, class U>
bool chmax(T& m, const U& v) {
    if (m < v) {
        m = v;
        return true;
    }
    return false;
}


ll N, P;
ll A[6100], memo[1 << 13];


void dfs(ll i, ll s, ll b) {
    if (i == N) {
        chmin(memo[b], abs(s));
        return;
    }

    ll nb = (b << 1);
    dfs(i + 1, s, nb);
    dfs(i + 1, s - A[i], nb + 1);
    dfs(i + 1, s + A[i], nb + 1);
}


void solve() {
    rep(i, 1 << N) memo[i] = inf;

    dfs(1, 0, 0);
    dfs(1, A[0], 1);

    ll a = 0;
    rep(i, 1 << N) a += memo[i];
    cout << a % P << endl;
}


// d == 0
void solve0() {
    ll ans = A[0];
    rep(i, N - 1) ans = ans * 2 % P;
    cout << ans << endl;
}


signed main() {
    ll T;
    cin >> T;
    while (T--) {
        cin >> N >> P;
        rep(i, N) cin >> A[i];

        if (N > 1 and A[0] == A[1]) {
            solve0();
        } else {
            solve();
        }
    }
}