import java.util.HashMap;
import java.util.Arrays;
import java.util.Scanner;

public class Coins {

    private int mChange;
    private int[] mCoins;
    private HashMap<Integer, Long>[] mCache;

    @SuppressWarnings("unchecked")
    public Coins(int change, int[] coins){
        mChange = change;
        mCoins = Arrays.copyOf(coins, coins.length);
        mCache = new HashMap[mCoins.length];
        for(int i=0; i<mCoins.length; i++){
            mCache[i] = new HashMap<Integer, Long>();
        }
    }

    public long calChange(int sum, int coinIdx){

        if(mCache[coinIdx].containsKey(sum)){
            return mCache[coinIdx].get(sum);
        }

        long nPossible =0;
        int left = mChange -sum;
        if(coinIdx ==0){
            if(left%mCoins[coinIdx] ==0) 
                return 1;
            else    return 0;
        }

        for(int i=0; i<left/mCoins[coinIdx]+1; i++){
            nPossible+=calChange(sum+mCoins[coinIdx]*i, coinIdx-1);
        }
        if(!mCache[coinIdx].containsKey(sum)) mCache[coinIdx].put(sum, nPossible);

        return nPossible;
    }

    public int nChange(){
        long nPossible =0;
        int bCoin = mCoins[mCoins.length-1];
        for(int i=0; i<mChange/bCoin+1; i++){
            nPossible+=calChange(i*bCoin, mCoins.length-2);
        }
        if(nPossible>1000000007){
            return (int)nPossible%1000000007;
        }
        return (int)nPossible;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int cases = sc.nextInt();
        while(cases-- >0){
            int change = sc.nextInt();
            int [] coins = new int[sc.nextInt()];
            for(int i=0; i<coins.length; i++){
                coins[i] = sc.nextInt();
            }
            Coins c = new Coins(change, coins);
            System.out.println(c.nChange());
        }
        sc.close();
    }

}