#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    int N, P;
    cin >> N >> P;
    vector<int> A(N);
    for (int j = 0; j < N; j++){
      cin >> A[j];
    }
    long long ans = 0;
    for (int j = 1; j < (1 << N); j++){
      long long tmp = INF;
      for (int k = j; ; k = (k - 1) & j){
        long long sum = 0;
        for (int l = 0; l < N; l++){
          if ((j >> l & 1) == 1){
            if ((k >> l & 1) == 0){
              sum += A[l];
            } else {
              sum -= A[l];
            }
          }
        }
        tmp = min(tmp, abs(sum));
        if (k == 0){
          break;
        }
      }
      ans += tmp;
      ans %= P;
    }
    cout << ans << endl;
  }
}