#include <iostream>
#define ll long long
#define eps 1e-9
#define PI 2 * acos (0.0)
using namespace std;

const int mod=1000000000 + 7;

ll dp[1005][1005];
int cnt[1005];
int ar[1005];

int main()
{



    int a,b,c,d,e,x,y,z,n,t,k;

    scanf("%d",&t);

    while(t--)
    {
        scanf("%d %d",&n,&k);

        for(a=0;a<=1000;a++)
        {
            cnt[a]=0;
            for(b=0;b<=1000;b++) dp[a][b]=0;
        }

        for(a=0;a<n;a++)
        {
            scanf("%d",&b);
            ar[a]=((b%k)+k)%k;
        }


        for(a=0;a<n;a++)
        {
            if(!a)
            {
                dp[0][ ar[a] ]=1;
                continue;
            }
            for(b=0;b<k;b++)
            {
                if(dp[a-1][b])
                {
                    dp[a][ (b+ar[a])%k ]=(dp[a][ (b+ar[a])%k ] +dp[a-1][b] )%mod;
                }
            }
            dp[ a ][ ar[a] ]=(dp[a][ar[a]]+1)%mod;
            for(b=0;b<k;b++)
            {
                dp[a][b]=(dp[a][b]+dp[a-1][b])%mod;
            }
        }

        cout<<(dp[n-1][0]+1)%mod<<endl;
        /*scanf("%d",&n);

        D[1]=1005;
        for(a=2;a<=n+1;a++) scanf("%d",&D[a]);
        D[n+2]=1005;

        U[1]=1005;
        for(a=2;a<=n+1;a++) scanf("%d",&U[a]);
        U[n+2]=1005;

        n=n+2;

        build(1,n,1);

        vector<int>v;
        v.clear();

        for(a=1;a<=n;a++) v.push_back(D[a]);

        cout<<trap(v)<<endl;*/

    }
    return 0;
}