#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cctype>
#include <utility>
#include <queue>
#include <cmath>
using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef double DB;
typedef long double LD;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define bit(x) (1 << (x))
#define bitl(x) (1LL << (x))
#define sqr(x) ((x) * (x))
#define sz(x) ((int)(x.size()))
#define counti(x) (__builtin_popcount(x))
#define countl(x) (__builtin_popcountll(x))
#define rep(i, n) for (int (i) = 0; (i) < (int)(n); ++(i))
#define X first
#define Y second

template <typename T, typename U> 
inline void chkmax(T& x, U y) {
    if (x < y) x = y;
}

template <typename T, typename U>
inline void chkmin(T& x, U y) {
    if (y < x) x = y;
}
int get() {
    char c;
    while (c = getchar(), (c < '0' || c > '9') && (c != '-'));
    bool flag = (c == '-');
    if (flag) c = getchar();
    int x = 0;
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - 48;
        c = getchar();
    }
    return flag ? -x : x;
}

void output(int x) {
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    int len = 0, data[20];
    while (x) {
        data[len++] = x % 10;
        x /= 10;
    }
    if (!len) data[len++] = 0;
    while (len--) putchar(data[len] + 48);
    putchar('\n');
}
#define MOD 1000000007
#define MX 1005

int val[MX][MX];
int a[MX], p, n;
inline void add(int &x, int y) {
    x += y;
    if (x >= MOD) x -= MOD;
}
int main() {
    
    int Tcase;
    for (scanf("%d", &Tcase); Tcase--;) {
        scanf("%d%d", &n, &p);
        for (int i = 1; i <= n; ++i) scanf("%d", a + i);
        val[0][0] = 1;
        int i, j;
        for (i = 1; i <= p; i++) val[0][i] = 0;
        for (i = 1; i <= n; i++) {
            
            for (j = 0; j < p; j++) {
                val[i][j] = val[i - 1][j];
                int x = (j - a[i]) % p;
                if (x < 0) x += p;
                add(val[i][j], val[i - 1][x]);
            }
        }
        printf("%d\n", val[n][0]);
    }
    return 0;
}