import java.util.*;

public class Main {
	public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        List<Integer> list = new ArrayList<Integer>();
        for (int tmp = 0; tmp < m; tmp++) {
            int w = sc.nextInt();

            list.add(w);
        }

        long INF = 1000000007;
        long[] dp = new long[n + 1];

        dp[0] = 1;
        dp[1] = 1;

        for (int i = 0; i < m; i++) {
            dp[list.get(i)] = -1;
        }

        for (int j = 2; j <= n; j++) {
            if (dp[j] != -1 && dp[j - 1] != -1 && dp[j - 2] != -1) {
                dp[j] = (dp[j - 1] + dp[j - 2]) % INF;
            } else if (dp[j] != -1 && dp[j - 1] == -1) {
                dp[j] = (dp[j - 2]);
            } else if (dp[j] != -1 && dp[j - 2] == -1) {
                dp[j] = (dp[j - 1]);
            }


        }
        if (dp[n] == -1) {
            System.out.println(0);
        } else {
            System.out.println(dp[n] % INF);
        }
    }
}
/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