n,m = map(int,input().split())

a = [0] * (n+2)
dp = [0] * (n+2)
mod = 1000000007

for i in range(m):
	num = int(input())
	a[num] = 1

dp[0]=1

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

print(dp[n]%mod) n,m = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m a = [0] * (n+2) a [0] * (n+2) [0] 0 n+2 n 2 dp = [0] * (n+2) dp [0] * (n+2) [0] 0 n+2 n 2 mod = 1000000007 mod 1000000007 for i in range(m):
	num = int(input())
	a[num] = 1 i range(m) range m num = int(input()) num int(input()) int input() input a[num] = 1 a[num] a num 1 dp[0]=1 dp[0] dp 0 1 for i in range(0,n):
	if a[i] == 1:
		continue
	dp[i] = dp[i]%mod
	dp[i+1] += dp[i]
	dp[i+2] += dp[i] i range(0,n) range 0 n if a[i] == 1:
		continue
	 a[i] == 1 a[i] a i 1 continue dp[i] = dp[i]%mod dp[i] dp i dp[i]%mod dp[i] dp i mod dp[i+1] += dp[i] dp[i+1] dp i+1 i 1 dp[i] dp i dp[i+2] += dp[i] dp[i+2] dp i+2 i 2 dp[i] dp i print(dp[n]%mod) print dp[n]%mod dp[n] dp n mod mod = 1000000007 1000000007 mod dp = [0] * (n+2) [0] * (n+2) dp n,m = map(int,input().split()) map(int,input().split()) n m = map(int,input().split()) map(int,input().split()) m a = [0] * (n+2) [0] * (n+2) a num = int(input()) int(input()) num
n,m = map(int,input().split())

a = [0] * (n+2)
dp = [0] * (n+2)
mod = 1000000007

for i in range(m):
	num = int(input())
	a[num] = 1

dp[0]=1

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

print(dp[n]%mod)