#pragma region template #include using namespace std; // clang-format off using ll = long long; using vl = vector; using vvl = vector; using ld = long double; using vld = vector; using vvld = vector; using pll = pair; using vpll = vector; using vvpll = vector; using vb = vector; using vvb = vector>; using vs = vector; using mll = map; template using V = vector; template using VV = V>; template using VVV = V>; template using max_heap = priority_queue; template using min_heap = priority_queue, greater>; constexpr ll inf = 3001001000100100100LL; #define endl '\n' #define _overload(_1, _2, _3, name, ...) name #define rep(...) _overload(__VA_ARGS__, _rep, _rep2,)(__VA_ARGS__) #define repc(...) _overload(__VA_ARGS__, _repc, _repc2,)(__VA_ARGS__) #define repr(...) _overload(__VA_ARGS__, _repr, _repr2,)(__VA_ARGS__) #define reprc(...) _overload(__VA_ARGS__, _reprc, _reprc2,)(__VA_ARGS__) #define _rep(i,k,n) for(ll i=(k) , i##_xxxx=(n); i < i##_xxxx; ++i) #define _repc(i,k,n) for(ll i=(k) , i##_xxxx=(n); i <=i##_xxxx; ++i) #define _repr(i,k,n) for(ll i=(n)-1, i##_xxxx=(k); i >=i##_xxxx; --i) #define _reprc(i,k,n) for(ll i=(n) , i##_xxxx=(k); i >=i##_xxxx; --i) #define _rep2(i,n) _rep(i,0,n) #define _repc2(i,n) _repc(i,1,n) #define _repr2(i,n) _repr(i,0,n) #define _reprc2(i,n) _reprc(i,1,n) #define rall(o) rbegin(o), rend(o) #define all(o) begin(o), end(o) template ll sz(const C& c) { return static_cast(c.size()); } template common_type_t min(const T& a, const U& b){ return std::min>(a,b); } template common_type_t max(const T& a, const U& b){ return std::max>(a,b); } template bool chmax(T& m, const U& v){ assert(numeric_limits::max() > v); if (m < v){ m = v; return true; } return false; } template bool chmin(T& m, const U& v){ assert(numeric_limits::min() < v); if (v < m){ m = v; return true; } return false; } template common_type_t cdiv(const T& a, const U& b){ return (a + b - 1) / b; } template common_type_t rdiv(const T& a, const T& b){ return (a + b / 2) / b; } template string join(const T& v, const S& sep ){ stringstream ss; bool f = false; for (const auto& e : v){ if (f) ss << sep; f = true; ss << e;} return ss.str(); } template string join(const T& v, const S& sep, const U& ...args){ stringstream ss; bool f = false; for (const auto& c : v){ if (f) ss << sep; f = true; ss << join(c, args...); } return ss.str(); } template ostream& operator<<(ostream& os, const vector& seq){ os << '[' << join(seq, ",") << ']'; return os; } template ostream& operator<<(ostream& os, const vector>& seq){ os << '[' << join(seq, ",\n ") << ']'; return os; } template ostream& operator<<(ostream& os, const deque& seq){ os << '[' << join(seq, ",") << ']'; return os; } template ostream& operator<<(ostream& os, const set& seq){ os << '{' << join(seq, ",") << '}'; return os; } template ostream& operator<<(ostream& os, const unordered_set& seq){ os << '{' << join(seq, ",") << '}'; return os; } template ostream& operator<<(ostream& os, const map& seq){ os << '{'; bool f = false; for (const auto& e : seq){ if (f) os << ','; f = true; os << e.first << ":" << e.second; } os << '}'; return os; } template ostream& operator<<(ostream& os, const pair& pa){ os << '(' << pa.first << ',' << pa.second << ')'; return os; } #if LOCAL #define debug(...) _debug(__VA_ARGS__, __LINE__) #else #define debug(...) #endif void print() { std::cout << '\n'; } template void print(const S& a){ std::cout << a << '\n'; } template void _debug(const S& a){ std::cerr << "(L:" << std::setw(3) << a << ")\n"; } template void print(const S& a, const T&... args){ std::cout << a << ' '; print(args...); } template void _debug(const S& a, const T&... args){ std::cerr << a << ' '; _debug(args...); } struct setup_main { setup_main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::cout << fixed << setprecision(15); } } setup_main_; // clang-format on #pragma endregion ll N, P; vl A, ans; void dfs(ll i, ll s, ll b) { if (i == N) { chmin(ans[b], abs(s)); return; } ll nb = b | (1 << i); dfs(i + 1, s, b); dfs(i + 1, s - A[i], nb); dfs(i + 1, s + A[i], nb); } void solve() { cin >> N >> P; A = vl(N); rep(i, N) cin >> A[i]; ans = vl(1 << N, inf); dfs(0, 0, 0); debug(ans); ll a = 0; rep(i, 1 << N) a += ans[i]; print(a % P); } signed main() { ll T; cin >> T; while (T--) { solve(); } }