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

n, m = map(int, input().split())
mod = 10 ** 9 + 7
broken = set()
for _ in range(m):
    broken.add(int(input()))

dp = [0 for _ in range(n + 1)]
dp[0] = 1
for i in range(n):
    for j in range(2):
        if i + 1 in broken:
            dp[i + 1] = 0
        else:
            if i - j >= 0:
                dp[i + 1] += dp[i - j] % mod

ans = dp[n] % mod
print(ans) n, m = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 broken = set() broken set() set 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 0 for _ in range(n + 1) for _ in range(n + 1) _ range(n + 1) range n + 1 n 1 for _ in range(n + 1) 0 dp = [0 for _ in range(n + 1)] dp [0 for _ in range(n + 1)] dp[0] = 1 dp[0] dp 0 1 for i in range(n):
    for j in range(2):
        if i + 1 in broken:
            dp[i + 1] = 0
        else:
            if i - j >= 0:
                dp[i + 1] += dp[i - j] % mod i range(n) range n for j in range(2):
        if i + 1 in broken:
            dp[i + 1] = 0
        else:
            if i - j >= 0:
                dp[i + 1] += dp[i - j] % mod j range(2) range 2 if i + 1 in broken:
            dp[i + 1] = 0
        else:
            if i - j >= 0:
                dp[i + 1] += dp[i - j] % mod i + 1 in broken i + 1 i 1 broken dp[i + 1] = 0 dp[i + 1] dp i + 1 i 1 0 if i - j >= 0:
                dp[i + 1] += dp[i - j] % mod i - j >= 0 i - j i j 0 dp[i + 1] += dp[i - j] % mod dp[i + 1] dp i + 1 i 1 dp[i - j] % mod dp[i - j] dp i - j i j mod ans = dp[n] % mod ans dp[n] % mod dp[n] dp n mod print(ans) print ans dp = [0 for _ in range(n + 1)] [0 for _ in range(n + 1)] dp mod = 10 ** 9 + 7 10 ** 9 + 7 mod broken = set() set() broken n, m = map(int, input().split()) map(int, input().split()) n m = map(int, input().split()) map(int, input().split()) m ans = dp[n] % mod dp[n] % mod ans
# https://atcoder.jp/contests/abc129/tasks/abc129_c

n, m = map(int, input().split())
mod = 10 ** 9 + 7
broken = set()
for _ in range(m):
    broken.add(int(input()))

dp = [0 for _ in range(n + 1)]
dp[0] = 1
for i in range(n):
    for j in range(2):
        if i + 1 in broken:
            dp[i + 1] = 0
        else:
            if i - j >= 0:
                dp[i + 1] += dp[i - j] % mod

ans = dp[n] % mod
print(ans)
