import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        long[] brokens = new long[n+1];
        long[] ins = new long[n+1];
        for(int i = 0;i < m;i++){
            brokens[sc.nextInt()] = 1;
        }
        for(int i = 1;i < n + 1;i++){
            if(brokens[i] == 1){
                ins[i] = 0;
            }else if(i == 1){
                ins[i] = 1;
            }else if(i == 2){
                ins[i] = ins[i - 1] + 1;
            }else{
                ins[i] = ins[i - 1] + ins[i - 2];
                ins[i] = ins[i] % 1000000007;
            }
        }
        System.out.println(ins[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