import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N, M;
		N = sc.nextInt();
		M = sc.nextInt();
		int[] broken = new int[N + 1];
		for (int i = 0; i < M; i++) {
			int a = sc.nextInt();
			broken[a] = 1;
		}

		int[] dp = new int[N + 2];
		dp[N] = 1;
		for(int i = N - 1; i >= 0; i--) {
			if (broken[i] == 1) {
				dp[i] = 0;
				continue;
			}
			dp[i] = (dp[i + 1] + dp[i + 2]) % 1000000007;
		}

		System.out.println(dp[0]);
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz