n, m = map(int, input().split())
MOD = 10**9+7

if m >= n//2+1:
    print(0)
    exit()

a = [True]*(n+1)
for i in range(m):
    a[int(input())] = False

p = [0]*(n+1)
for i in range(1, n+1):
    if i == 1:
        if a[i]:
            p[i] += 1
        continue
    if i == 2:
        if a[i]:
            p[i] += 1

    if a[i]:
        p[i] += p[i-1] + p[i-2]
        p[i] %= MOD
print(p[n]) n, m = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m MOD = 10**9+7 MOD 10**9+7 10**9 10 9 7 if m >= n//2+1:
    print(0)
    exit() m >= n//2+1 m n//2+1 n//2 n 2 1 print(0) print 0 exit() exit a = [True]*(n+1) a [True]*(n+1) [True] True n+1 n 1 for i in range(m):
    a[int(input())] = False i range(m) range m a[int(input())] = False a[int(input())] a int(input()) int input() input False p = [0]*(n+1) p [0]*(n+1) [0] 0 n+1 n 1 for i in range(1, n+1):
    if i == 1:
        if a[i]:
            p[i] += 1
        continue
    if i == 2:
        if a[i]:
            p[i] += 1

    if a[i]:
        p[i] += p[i-1] + p[i-2]
        p[i] %= MOD i range(1, n+1) range 1 n+1 n 1 if i == 1:
        if a[i]:
            p[i] += 1
        continue
     i == 1 i 1 if a[i]:
            p[i] += 1
         a[i] a i p[i] += 1 p[i] p i 1 continue if i == 2:
        if a[i]:
            p[i] += 1

     i == 2 i 2 if a[i]:
            p[i] += 1

     a[i] a i p[i] += 1 p[i] p i 1 if a[i]:
        p[i] += p[i-1] + p[i-2]
        p[i] %= MOD a[i] a i p[i] += p[i-1] + p[i-2] p[i] p i p[i-1] + p[i-2] p[i-1] p i-1 i 1 p[i-2] p i-2 i 2 p[i] %= MOD p[i] p i MOD print(p[n]) print p[n] p n p = [0]*(n+1) [0]*(n+1) p MOD = 10**9+7 10**9+7 MOD a = [True]*(n+1) [True]*(n+1) a m = map(int, input().split()) map(int, input().split()) m n, m = map(int, input().split()) map(int, input().split()) n
n, m = map(int, input().split())
MOD = 10**9+7

if m >= n//2+1:
    print(0)
    exit()

a = [True]*(n+1)
for i in range(m):
    a[int(input())] = False

p = [0]*(n+1)
for i in range(1, n+1):
    if i == 1:
        if a[i]:
            p[i] += 1
        continue
    if i == 2:
        if a[i]:
            p[i] += 1

    if a[i]:
        p[i] += p[i-1] + p[i-2]
        p[i] %= MOD
print(p[n])