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

public class Main {

    static int[] coinArray;
    static int targetMoney;
    static int cnt;
    static HashMap<String, Integer> map = new HashMap<String, Integer>();
    static HashMap<String, Integer> cntmap = new HashMap<String, Integer>();    //for debug 원래는 cnt를 쓰면 된다


    public static void main(String[] args) {
        // TODO Auto-generated method stub

        Scanner sc = new Scanner(System.in);
        int cases = sc.nextInt();
        while (cases-- > 0) {
            map.clear();
            cntmap.clear();
            cnt = 0;

            targetMoney = sc.nextInt();
            int moneyCases = sc.nextInt();

            coinArray = new int[moneyCases];
            int[] array = new int[moneyCases];
            map.put(Arrays.toString(array)
                    , 0);
            for (int i = 0; i < moneyCases; i++) {
                coinArray[i] = sc.nextInt();
            }

            recursiveEachCase(array.clone());
            if (cntmap.size() > 1000000007) {
                System.out.println(cntmap.size() % 1000000007);
            } else
                System.out.println(cntmap.size());
        }
    }

    private static int recursiveEachCase(int[] array) {
        for (int i = 0; i < coinArray.length; i++) {
            // 현재 메소드에서 사용할 동전 개수 증가
            array[i]++;

            Integer nextSum = map.get(Arrays.toString(array));
            if( nextSum == null )
            {
                int [] prearray = array.clone();
                prearray[i]--;
                nextSum = coinArray[i] + map.get(Arrays.toString(prearray));
                map.put(Arrays.toString(array), nextSum);
            }

            if (nextSum > targetMoney) {
                return -1;
            }
            if (nextSum == targetMoney) {
                cntmap.put(Arrays.toString(array), nextSum);
                return -1;
            }
            recursiveEachCase(array.clone());
            array[i]--;
        }

        return -1;
    }

}