import java.util.Scanner;

public class Main {

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