#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
const int mo=1000000007;
const int N=1010;
int T,n,m;
int a[N],f[2][N];
int main()
{
    cin>>T;
    while (T--)
    {
        cin>>n>>m;
        for (int i=1;i<=n;i++) cin>>a[i];
        memset(f,0,sizeof(f));
        f[0][0]=1;
        for (int i=1;i<=n;i++)
            for (int j=0;j<m;j++)
                f[i%2][((j+a[i])%m+m)%m]=(f[1-i%2][j]+f[1-i%2][((j+a[i])%m+m)%m])%mo;
        cout<<f[n%2][0]<<endl;
    }
    return 0;
}