# Algospot tutorial problem - DP
#
# Coin problem solved by dynamic programming
#
# Name: Jeonghun
# Collaborators: None
# Time: started at 3:28 PM on March 28th
#       ended at ...
import sys

def eval_coins(total, num_kind, coin_list, memo):
    if memo[total][num_kind] != 0: return memo[total][num_kind]
    else:
        if num_kind == 1:
            if total % coin_list[num_kind - 1] == 0:
                memo[total][num_kind] = 1
                return 1
            else: return 0
        else:
            if coin_list[num_kind - 1] > total:
                memo[total][num_kind] = eval_coins(total, num_kind - 1, coin_list, memo)
                return memo[total][num_kind]
            else:
                memo[total][num_kind] = eval_coins(total, num_kind - 1, coin_list, memo) \
                        + eval_coins(total - coin_list[num_kind - 1], num_kind, coin_list, memo)
                return memo[total][num_kind]
def main():
    rl = lambda: sys.stdin.readline()
    numTest = rl().strip()
    for _ in range(int(numTest)):
        memo = [[0 for x in range(101)] for y in range(5001)]
        total, num_kind = map(int, rl().strip().split())
        coin_list = map(int,rl().split())
        res = eval_coins(total, num_kind, coin_list, memo)
        print res % 1000000007L
    return
main()