N, M = map(int, input().split())
DIVZ = 10**9+7

steps = [0]*(N+3)
for i in range(M):
    bb = int(input())
    steps[bb] = -1

steps[0] = 1
for i in range(N):
    if steps[i] > 0:
        if steps[i+1] >= 0:
            steps[i+1] += steps[i]
            steps[i + 1] %= DIVZ
        if steps[i+2] >= 0:
            steps[i+2] += steps[i]
            steps[i+2] %= DIVZ

print(steps[N])
 N, M = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M DIVZ = 10**9+7 DIVZ 10**9+7 10**9 10 9 7 steps = [0]*(N+3) steps [0]*(N+3) [0] 0 N+3 N 3 for i in range(M):
    bb = int(input())
    steps[bb] = -1 i range(M) range M bb = int(input()) bb int(input()) int input() input steps[bb] = -1 steps[bb] steps bb -1 steps[0] = 1 steps[0] steps 0 1 for i in range(N):
    if steps[i] > 0:
        if steps[i+1] >= 0:
            steps[i+1] += steps[i]
            steps[i + 1] %= DIVZ
        if steps[i+2] >= 0:
            steps[i+2] += steps[i]
            steps[i+2] %= DIVZ i range(N) range N if steps[i] > 0:
        if steps[i+1] >= 0:
            steps[i+1] += steps[i]
            steps[i + 1] %= DIVZ
        if steps[i+2] >= 0:
            steps[i+2] += steps[i]
            steps[i+2] %= DIVZ steps[i] > 0 steps[i] steps i 0 if steps[i+1] >= 0:
            steps[i+1] += steps[i]
            steps[i + 1] %= DIVZ
         steps[i+1] >= 0 steps[i+1] steps i+1 i 1 0 steps[i+1] += steps[i] steps[i+1] steps i+1 i 1 steps[i] steps i steps[i + 1] %= DIVZ steps[i + 1] steps i + 1 i 1 DIVZ if steps[i+2] >= 0:
            steps[i+2] += steps[i]
            steps[i+2] %= DIVZ steps[i+2] >= 0 steps[i+2] steps i+2 i 2 0 steps[i+2] += steps[i] steps[i+2] steps i+2 i 2 steps[i] steps i steps[i+2] %= DIVZ steps[i+2] steps i+2 i 2 DIVZ print(steps[N]) print steps[N] steps N bb = int(input()) int(input()) bb N, M = map(int, input().split()) map(int, input().split()) N DIVZ = 10**9+7 10**9+7 DIVZ M = map(int, input().split()) map(int, input().split()) M steps = [0]*(N+3) [0]*(N+3) steps
N, M = map(int, input().split())
DIVZ = 10**9+7

steps = [0]*(N+3)
for i in range(M):
    bb = int(input())
    steps[bb] = -1

steps[0] = 1
for i in range(N):
    if steps[i] > 0:
        if steps[i+1] >= 0:
            steps[i+1] += steps[i]
            steps[i + 1] %= DIVZ
        if steps[i+2] >= 0:
            steps[i+2] += steps[i]
            steps[i+2] %= DIVZ

print(steps[N])

