import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

md = 10**9+7
# md = 998244353

def dot(aa, bb):
    h = len(aa)
    w = len(bb[0])
    res = [[0]*w for _ in range(h)]
    for j, col in enumerate(zip(*bb)):
        for i in range(h):
            v = 0
            # for a, b in zip(row, col): v += a*b
            # res[i][j] = v
            for a, b in zip(aa[i], col): v += a*b%md
            res[i][j] = v%md
    return res

def matpow(mat, e):
    n = len(mat)
    res = [[1 if i == j else 0 for j in range(n)] for i in range(n)]
    while e:
        if e & 1: res = dot(res, mat)
        mat = dot(mat, mat)
        e >>= 1
    return res

L,N,M=LI()
KK=LI()

ac=[]
ac2i={}
for a in range(1,N+1):
    for c in range(1,a+2):
        ac2i[a,c]=len(ac)
        ac.append((a,c))

n=len(ac)+1
mat=[[0]*n for _ in range(n)]
for i,(a,c) in enumerate(ac):
    for na in range(1,N+1):
        nc=1
        if na==a:nc=min(a+1,c+1)
        j=ac2i[na,nc]
        mat[i][j]=1
for a in KK:
    i=ac2i[a,a]
    mat[i]=[0]*n
    mat[i][i+1]=1
    mat[i][n-1]=N-1
mat[n-1][n-1]=N

mat=matpow(mat,L-1)
aa = [0]*n
for a in range(1,1+N):
    i=ac2i[a,1]
    aa[i]=1

mat=dot([aa],mat)
ans=mat[0][-1]
for a in KK:
    i=ac2i[a,a]
    ans+=mat[0][i]
    ans%=md
print(ans)