import std.stdio;
long div = 1_000_000_007;
void main() {
	long n, m;
	scanf("%ld %ld\n", &n, &m);
	long[] dp = new long[n+1];
	long a;
	scanf("%ld\n", &a);
	foreach(i; 0..n+1) {
		if (a == i) {
			scanf("%ld\n", &a);
			dp[i] = 0;
		}
		else if (i >= 2) {
			dp[i] = (dp[i-1] + dp[i-2]) % div;
		}
		else {
			dp[i] = 1;
		}
	}
	dp[n].write;
}
