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