

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int m = Integer.parseInt(sc.next());
        boolean[] isBroken = new boolean[n+1];
        for(int i=0;i<m;i++){
            isBroken[Integer.parseInt(sc.next())] = true;
        }
        long dp[] = new long[n+1];
        dp[0] = 1;
        if(!isBroken[1]){
            dp[1] = 1;
        }
        for(int i=2;i<=n;i++){
            if(!isBroken[i]){
                dp[i] = (dp[i-1]+dp[i-2])%1000000007;
            }
        }
        System.out.println(dp[n]);
    }
}
/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