n,m = map(int,input().split())
dp = [-1]*(n+1) 
dp[0] = 1
mod = 10**9 + 7
for i in range(m):
    a = int(input())
    dp[a-1] = 0
#print(dp)
for i in range(1,n+1):
    if dp[i] == 0:
        continue
    else:
        if i == 1:
            dp[i] = dp[i-1] +1
        else:
            dp[i] = (dp[i-1] + dp[i-2])%mod
        #print(dp)
print(dp[n-1]) n,m = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m dp = [-1]*(n+1) dp [-1]*(n+1) [-1] -1 n+1 n 1 dp[0] = 1 dp[0] dp 0 1 mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 for i in range(m):
    a = int(input())
    dp[a-1] = 0
#print(dp) i range(m) range m a = int(input()) a int(input()) int input() input dp[a-1] = 0 dp[a-1] dp a-1 a 1 0 for i in range(1,n+1):
    if dp[i] == 0:
        continue
    else:
        if i == 1:
            dp[i] = dp[i-1] +1
        else:
            dp[i] = (dp[i-1] + dp[i-2])%mod
        #print(dp) i range(1,n+1) range 1 n+1 n 1 if dp[i] == 0:
        continue
    else:
        if i == 1:
            dp[i] = dp[i-1] +1
        else:
            dp[i] = (dp[i-1] + dp[i-2])%mod
        #print(dp) dp[i] == 0 dp[i] dp i 0 continue if i == 1:
            dp[i] = dp[i-1] +1
        else:
            dp[i] = (dp[i-1] + dp[i-2])%mod
        #print(dp) i == 1 i 1 dp[i] = dp[i-1] +1 dp[i] dp i dp[i-1] +1 dp[i-1] dp i-1 i 1 1 dp[i] = (dp[i-1] + dp[i-2])%mod dp[i] dp i (dp[i-1] + dp[i-2])%mod dp[i-1] + dp[i-2] dp[i-1] dp i-1 i 1 dp[i-2] dp i-2 i 2 mod print(dp[n-1]) print dp[n-1] dp n-1 n 1 m = map(int,input().split()) map(int,input().split()) m dp = [-1]*(n+1) [-1]*(n+1) dp n,m = map(int,input().split()) map(int,input().split()) n mod = 10**9 + 7 10**9 + 7 mod a = int(input()) int(input()) a
n,m = map(int,input().split())
dp = [-1]*(n+1) 
dp[0] = 1
mod = 10**9 + 7
for i in range(m):
    a = int(input())
    dp[a-1] = 0
#print(dp)
for i in range(1,n+1):
    if dp[i] == 0:
        continue
    else:
        if i == 1:
            dp[i] = dp[i-1] +1
        else:
            dp[i] = (dp[i-1] + dp[i-2])%mod
        #print(dp)
print(dp[n-1])