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