import java.util.*;

public class Main {
    private static long[] dp = new long[100100];
    private static final long INF = 1L << 60;
    private static final long MOD = 1000000007L;
    public static void main(String[] args) throws Exception {
        Arrays.fill(dp,0);
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        int W = Integer.parseInt(sc.next());
        boolean brokenSteps[] = new boolean[100100];
        Arrays.fill(brokenSteps,false);
        for(int i=0;i<W;i++){
            brokenSteps[Integer.parseInt(sc.next())] = true;
        }
        dp[0] = 1;
        long res = 1;
        for(int i=0;i<=N;i++){
            for(int j=i+1;j<=Math.min(N,i+2);j++){
                if(!brokenSteps[j]){
                    dp[j] += dp[i];
                    dp[j] %= MOD;
                }
            }
        }
        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