#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int MOD=1e9+7;
ll dp[2000];
int num[2000];
ll vis[2000][1001];

int main(){
    int t;
    int n,p;
    scanf("%d",&t);
    while(t--){
        mem0(dp);
        dp[0]=1;
        mem0(vis);
        scanf("%d%d",&n,&p);
        for(int i=1;i<=n;i++)
            scanf("%d",&num[i]);
        for(int j=1;j<=n;j++){
            for(int i=0;i<p;i++){
                int x=(num[j]+i)%p;
                if(x<0)
                    x+=p;
                dp[x]=(dp[x]+dp[i])%MOD;
                if(vis[i][j]!=0){
                    dp[x]=(dp[x]-vis[i][j])%MOD;
                    if(dp[x]<0)
                        dp[x]+=MOD;
                }
                vis[x][j]=(vis[x][j]+dp[i]-vis[i][j])%MOD;
                if(vis[x][j]<0)
                    vis[x][j]+=MOD;
                //cout<<x<<"PPP"<<dp[x]<<endl;
            }
        }
        printf("%I64d\n",dp[0]);
    }
    return 0;
}