# https://atcoder.jp/contests/abc129/tasks/abc129_c

n, m = [int(i) for i in input().split()]
broken = set()
MOD = 10**9 + 7
for _ in range(m):
    broken.add(int(input()))

steps = [0] * (n + 1)
steps[0] = 1
if 1 in broken:
    steps[1] = 0
else:
    steps[1] = 1

for i in range(2, n + 1):
    if i in broken:
        steps[i] = 0
    else:
        steps[i] = (steps[i - 1] + steps[i - 2]) % MOD

print(steps[n]) int(i) for i in input().split() for i in input().split() i input().split() ().split () input split for i in input().split() int(i) int i n, m = [int(i) for i in input().split()] n [int(i) for i in input().split()] m broken = set() broken set() set MOD = 10**9 + 7 MOD 10**9 + 7 10**9 10 9 7 for _ in range(m):
    broken.add(int(input())) _ range(m) range m broken.add(int(input())) broken.add broken add int(input()) int input() input steps = [0] * (n + 1) steps [0] * (n + 1) [0] 0 n + 1 n 1 steps[0] = 1 steps[0] steps 0 1 if 1 in broken:
    steps[1] = 0
else:
    steps[1] = 1 1 in broken 1 broken steps[1] = 0 steps[1] steps 1 0 steps[1] = 1 steps[1] steps 1 1 for i in range(2, n + 1):
    if i in broken:
        steps[i] = 0
    else:
        steps[i] = (steps[i - 1] + steps[i - 2]) % MOD i range(2, n + 1) range 2 n + 1 n 1 if i in broken:
        steps[i] = 0
    else:
        steps[i] = (steps[i - 1] + steps[i - 2]) % MOD i in broken i broken steps[i] = 0 steps[i] steps i 0 steps[i] = (steps[i - 1] + steps[i - 2]) % MOD steps[i] steps i (steps[i - 1] + steps[i - 2]) % MOD steps[i - 1] + steps[i - 2] steps[i - 1] steps i - 1 i 1 steps[i - 2] steps i - 2 i 2 MOD print(steps[n]) print steps[n] steps n n, m = [int(i) for i in input().split()] [int(i) for i in input().split()] n MOD = 10**9 + 7 10**9 + 7 MOD steps = [0] * (n + 1) [0] * (n + 1) steps broken = set() set() broken m = [int(i) for i in input().split()] [int(i) for i in input().split()] m
# https://atcoder.jp/contests/abc129/tasks/abc129_c

n, m = [int(i) for i in input().split()]
broken = set()
MOD = 10**9 + 7
for _ in range(m):
    broken.add(int(input()))

steps = [0] * (n + 1)
steps[0] = 1
if 1 in broken:
    steps[1] = 0
else:
    steps[1] = 1

for i in range(2, n + 1):
    if i in broken:
        steps[i] = 0
    else:
        steps[i] = (steps[i - 1] + steps[i - 2]) % MOD

print(steps[n])
