n,m=map(int, input().split())
a=[False]*(n+1)
for i in range(m):
    A=int(input())
    a[A]=True
mod=10**9+7
dp=[0]*(n+1)

if not a[1]:
    dp[1]=1

if n>1:
    if not a[2]:
        dp[2]=dp[1]+1

for i in range(3,n+1):
    if not a[i-2]:
        dp[i]+=dp[i-2]
        dp[i]%=mod
    if not a[i-1]:
        dp[i]+=dp[i-1]
        dp[i]%=mod
    if a[i]:
        dp[i]=0

print(dp[n]%mod) n,m=map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m a=[False]*(n+1) a [False]*(n+1) [False] False n+1 n 1 for i in range(m):
    A=int(input())
    a[A]=True i range(m) range m A=int(input()) A int(input()) int input() input a[A]=True a[A] a A True mod=10**9+7 mod 10**9+7 10**9 10 9 7 dp=[0]*(n+1) dp [0]*(n+1) [0] 0 n+1 n 1 if not a[1]:
    dp[1]=1 not a[1] a[1] a 1 dp[1]=1 dp[1] dp 1 1 if n>1:
    if not a[2]:
        dp[2]=dp[1]+1 n>1 n 1 if not a[2]:
        dp[2]=dp[1]+1 not a[2] a[2] a 2 dp[2]=dp[1]+1 dp[2] dp 2 dp[1]+1 dp[1] dp 1 1 for i in range(3,n+1):
    if not a[i-2]:
        dp[i]+=dp[i-2]
        dp[i]%=mod
    if not a[i-1]:
        dp[i]+=dp[i-1]
        dp[i]%=mod
    if a[i]:
        dp[i]=0 i range(3,n+1) range 3 n+1 n 1 if not a[i-2]:
        dp[i]+=dp[i-2]
        dp[i]%=mod
     not a[i-2] a[i-2] a i-2 i 2 dp[i]+=dp[i-2] dp[i] dp i dp[i-2] dp i-2 i 2 dp[i]%=mod dp[i] dp i mod if not a[i-1]:
        dp[i]+=dp[i-1]
        dp[i]%=mod
     not a[i-1] a[i-1] a i-1 i 1 dp[i]+=dp[i-1] dp[i] dp i dp[i-1] dp i-1 i 1 dp[i]%=mod dp[i] dp i mod if a[i]:
        dp[i]=0 a[i] a i dp[i]=0 dp[i] dp i 0 print(dp[n]%mod) print dp[n]%mod dp[n] dp n mod A=int(input()) int(input()) A n,m=map(int, input().split()) map(int, input().split()) n mod=10**9+7 10**9+7 mod m=map(int, input().split()) map(int, input().split()) m dp=[0]*(n+1) [0]*(n+1) dp a=[False]*(n+1) [False]*(n+1) a
n,m=map(int, input().split())
a=[False]*(n+1)
for i in range(m):
    A=int(input())
    a[A]=True
mod=10**9+7
dp=[0]*(n+1)

if not a[1]:
    dp[1]=1

if n>1:
    if not a[2]:
        dp[2]=dp[1]+1

for i in range(3,n+1):
    if not a[i-2]:
        dp[i]+=dp[i-2]
        dp[i]%=mod
    if not a[i-1]:
        dp[i]+=dp[i-1]
        dp[i]%=mod
    if a[i]:
        dp[i]=0

print(dp[n]%mod)