#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof a)
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
ll read(){
    ll ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    return ans;
}
//head
int dp[1100][1100];
void add(int &a,int b){a=mo(a+b,pp);}
int main(){
    int T=read();
    while(T--){
        int n=read(),m=read();
        rep(i,0,n)
            rep(j,0,m-1)dp[i][j]=0;
        dp[0][0]=1;
        rep(i,1,n){
            int x=read();
            rep(j,0,m-1){
                add(dp[i][mo(j+x,m)],dp[i-1][j]);
                add(dp[i][j],dp[i-1][j]);
                }
        }
        printf("%d\n",dp[n][0]);
    }
    return 0;
}