#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <set>
#include <map>
#include <list>
#include <queue>
#include <string>
#include <vector>
#include <fstream>
#include <iterator>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define eps 1e-6
#define MAXN 1010
#define MAXM 100
#define dd {cout<<"debug"<<endl;}
#define pa {system("pause");}
#define p(x) {printf("%d\n", x);}
#define pd(x) {printf("%.7lf\n", x);}
#define k(x) {printf("Case %d: ", ++x);}
#define s(x) {scanf("%d", &x);}
#define sd(x) {scanf("%lf", &x);}
#define mes(x, d) {memset(x, d, sizeof(x));}
#define do(i, x) for(i = 0; i < x; i ++)
#define dod(i, x, l) for(i = x; i >= l; i --)
#define doe(i, x) for(i = 1; i <= x; i ++)
int n, p;
int f[MAXN];
LL dp[MAXN][MAXN];
void show(int pos)
{
    for(int i = p; i >= 0; i --)
        printf("%d ", dp[pos][i]);
    printf("\n");
}

int main()
{
    int T;
    scanf("%d", &T);
    while(T --)
    {
        scanf("%d %d", &n, &p);
        for(int i = 0; i < n; i ++)
        {
            scanf("%d", &f[i]);
            f[i] = (f[i] % p + p) % p;
        }
        memset(dp, 0, sizeof(dp));
        dp[0][0] = 1;
        for(int i = 0; i < n; i ++)
            for(int j = 0; j < p; j ++)
            {
                dp[i + 1][j] += dp[i][j];
                dp[i + 1][j] %= MOD;

                dp[i + 1][(j + f[i]) % p] += dp[i][j];
                dp[i + 1][(j + f[i]) % p] %= MOD;
            }
        printf("%I64d\n", dp[n][0]);
    }
    return 0;
}