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 mod=1000000007;
		int[] a =new int[m];
		long[] dp=new long[n+1];
		dp[0]=1;
		for(int i=0; i<m; i++){
			a[i] = sc.nextInt();
			if(i!=0 && a[i]==a[i-1]+1){
				System.out.println(0);
				return;
			}
		}
		int count=0;
		boolean kk=false;
		for(int i=1; i<n+1; i++){
			if(m!=0 && !kk && i==a[count] && i!=n){
				count++;
				if(count>m-1){
					count=0;
					kk=true;
				}
				dp[i+1]=dp[i-1];
			}else{
				if(i==1){
					dp[i]+=dp[i-1];
					dp[i]%=mod;
					continue;
				}
				if(dp[i]==0){
					dp[i]+=dp[i-1]+dp[i-2];
					dp[i]%=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