#include <stdio.h>

int T;          // 1<=T<=100
int M;          // 1<=M<=5000
int C;          // 1<=C<=100 , the biggest coin is 5000
int CDATA[100]; // max is 100
int ANSWER;
int memo[5000][100];
int z;

int find(int M, int maxidx)
{
    int cnt = 0;

    // condition for end
    if(M == 0)
        return 1;
    else if (M < 0)                 
        return 0;

    // memoization
    if(memo[M][maxidx] != 0)
        return memo[M][maxidx];

    // recursive function
    for(int i=0;i<C;i++)
    {
        if(CDATA[i] <= CDATA[maxidx] && M-CDATA[i]>=0)
            cnt = cnt + find(M-CDATA[i],i);
    }

    // problem's limitation
    cnt = cnt % 1000000007;

    // memoization
    memo[M][maxidx] = cnt;

    return cnt;
}

int main(void)
{
    int max =0;
    int maxidx = 0;

    scanf("%d", &T);

    for(int i=0;i<T;i++)
    {
        // init
        ANSWER = 0;
        z = 0;
        max = 0;

        // input
        scanf("%d %d", &M, &C);

        for(int j=0;j<C;j++)
        {
            int temp;
            int flag = 0;

            scanf("%d", &temp);

            for(int k=0;k<j;k++)
            {
                if(CDATA[k] == temp) flag = 1;
            }

            if(flag == 0) {
                CDATA[z] = temp;
                z++;
            }
        }

        // input correction
        C = z;

        if(M == 0) {
            printf("%d\n",M);

            for(int j=0;j<5000;j++)
                for(int k=0;k<C;k++)
                    memo[j][k] = 0;

            continue;
        }

        // find biggest coin
        for(int j=0;j<C;j++)
        {
            if(max<CDATA[j]) {
                max = CDATA[j]; maxidx = j;
            }
        }

        printf("%d\n",find(M,maxidx));

        // init
        for(int j=0;j<5000;j++)
            for(int k=0;k<C;k++)
                memo[j][k] = 0;
    }

    return 0;
}