import java.util.Scanner;

public class Main {

	public static final long MOD = 1000000007L;

	public static void main(String args[]) {

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();

		long[] a = new long[M];
		long[] steps = new long[N+1];
		for(int i=0;i<N;i++) {
			steps[i] = 0;
		}

		for(int i=0;i<M;i++) {
			a[i] = sc.nextLong();
			steps[(int) a[i]] = -1;
		}

		steps[0] = 1;
		steps[1] = (steps[1] == -1) ? -1 : 1;
		for(int i=2;i<N+1;i++) {

			if(steps[i] == -1) continue;

			if(steps[i-1] == -1 && steps[i-2] == -1) {
				System.out.println(0);
				return;
			}

			if(steps[i-1] == -1) {
				steps[i] = steps[i-2];
			}else if(steps[i-2] == -1) {
				steps[i] = steps[i-1];
			}else {
				steps[i] = (steps[i-1] + steps[i-2])%MOD;
			}
		}
		System.out.println(steps[N]%MOD);
	}
}
/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