mod = 10 ** 9 + 7

n, m = map(int, input().split())
A = [int(input()) for _ in range(m)]
not_wet = [True] * (n + 1)
for a in A:
    not_wet[a] = False
dp = [0] * (n + 1)
dp[0] = 1
for i in range(1, n + 1):
    if not_wet[i]:
        if i == 1:
            dp[i] = dp[i - 1] % mod
        else:
            dp[i] = dp[i - 1] + dp[i - 2] % mod
print(dp[n] % mod) 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 int(input()) for _ in range(m) for _ in range(m) _ range(m) range m for _ in range(m) int(input()) int input() input A = [int(input()) for _ in range(m)] A [int(input()) for _ in range(m)] not_wet = [True] * (n + 1) not_wet [True] * (n + 1) [True] True n + 1 n 1 for a in A:
    not_wet[a] = False a A not_wet[a] = False not_wet[a] not_wet a False dp = [0] * (n + 1) dp [0] * (n + 1) [0] 0 n + 1 n 1 dp[0] = 1 dp[0] dp 0 1 for i in range(1, n + 1):
    if not_wet[i]:
        if i == 1:
            dp[i] = dp[i - 1] % mod
        else:
            dp[i] = dp[i - 1] + dp[i - 2] % mod i range(1, n + 1) range 1 n + 1 n 1 if not_wet[i]:
        if i == 1:
            dp[i] = dp[i - 1] % mod
        else:
            dp[i] = dp[i - 1] + dp[i - 2] % mod not_wet[i] not_wet i if i == 1:
            dp[i] = dp[i - 1] % mod
        else:
            dp[i] = dp[i - 1] + dp[i - 2] % mod i == 1 i 1 dp[i] = dp[i - 1] % mod dp[i] dp i dp[i - 1] % mod dp[i - 1] dp i - 1 i 1 mod dp[i] = dp[i - 1] + dp[i - 2] % mod dp[i] dp i dp[i - 1] + dp[i - 2] % mod dp[i - 1] dp i - 1 i 1 dp[i - 2] % mod dp[i - 2] dp i - 2 i 2 mod print(dp[n] % mod) print dp[n] % mod dp[n] dp n mod not_wet = [True] * (n + 1) [True] * (n + 1) not_wet mod = 10 ** 9 + 7 10 ** 9 + 7 mod n, m = map(int, input().split()) map(int, input().split()) n dp = [0] * (n + 1) [0] * (n + 1) dp A = [int(input()) for _ in range(m)] [int(input()) for _ in range(m)] A m = map(int, input().split()) map(int, input().split()) m
mod = 10 ** 9 + 7

n, m = map(int, input().split())
A = [int(input()) for _ in range(m)]
not_wet = [True] * (n + 1)
for a in A:
    not_wet[a] = False
dp = [0] * (n + 1)
dp[0] = 1
for i in range(1, n + 1):
    if not_wet[i]:
        if i == 1:
            dp[i] = dp[i - 1] % mod
        else:
            dp[i] = dp[i - 1] + dp[i - 2] % mod
print(dp[n] % mod)
