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();
        int[] a = new int[N];
        Arrays.fill(a, 0);
        for(int i = 0; i < M; i++){
            int n = sc.nextInt();
            a[n-1] = -1;
        }
        long[] dp = new long[N+1];
        long mod = 1000000007;
        dp[0] = 1;
        if(a[0] == 0)
            dp[1] = 1;
        for(int i = 1; i < N; i++){
            dp[i+1] = (dp[i] + dp[i-1]) % mod;
            if(a[i] == -1)
                dp[i+1] = 0;
        }
        System.out.println(dp[N]);
        sc.close();
    }
}

/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