
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();
		boolean[] broken = new boolean[n+1];
		
		for (int i=0;i<m;i++) {
			broken[sc.nextInt()]=true;
		}
		
		long[] dp = new long[n+1];
		dp[0]=1;
		
		for (int i=1;i<=n;i++) {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		}
		System.out.println(dp[n]);
	}
} import java.util.Scanner; Scanner java.util public class Main {
	
	

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		

		int n = sc.nextInt();
		int m = sc.nextInt();
		boolean[] broken = new boolean[n+1];
		
		for (int i=0;i<m;i++) {
			broken[sc.nextInt()]=true;
		}
		
		long[] dp = new long[n+1];
		dp[0]=1;
		
		for (int i=1;i<=n;i++) {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		}
		System.out.println(dp[n]);
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		

		int n = sc.nextInt();
		int m = sc.nextInt();
		boolean[] broken = new boolean[n+1];
		
		for (int i=0;i<m;i++) {
			broken[sc.nextInt()]=true;
		}
		
		long[] dp = new long[n+1];
		dp[0]=1;
		
		for (int i=1;i<=n;i++) {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		}
		System.out.println(dp[n]);
	} main {
		Scanner sc = new Scanner(System.in);
		

		int n = sc.nextInt();
		int m = sc.nextInt();
		boolean[] broken = new boolean[n+1];
		
		for (int i=0;i<m;i++) {
			broken[sc.nextInt()]=true;
		}
		
		long[] dp = new long[n+1];
		dp[0]=1;
		
		for (int i=1;i<=n;i++) {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		}
		System.out.println(dp[n]);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int m = sc.nextInt(); m sc.nextInt() sc.nextInt sc boolean[] broken = new boolean[n+1]; broken new boolean[n+1] n+1 n 1 for (int i=0;i<m;i++) {
			broken[sc.nextInt()]=true;
		} int i=0; int i=0; i 0 i<m i m i++ i++ i {
			broken[sc.nextInt()]=true;
		} {
			broken[sc.nextInt()]=true;
		} broken[sc.nextInt()]=true broken[sc.nextInt()] broken sc.nextInt() sc.nextInt sc true long[] dp = new long[n+1]; dp new long[n+1] n+1 n 1 dp[0]=1 dp[0] dp 0 1 for (int i=1;i<=n;i++) {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		} int i=1; int i=1; i 1 i<=n i n i++ i++ i {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		} {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		} if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			} broken[i] broken i {
				dp[i]=0;
			} dp[i]=0 dp[i] dp i 0 {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			} if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				} i==1 i 1 {
					dp[i]=1;
				} dp[i]=1 dp[i] dp i 1 {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				} dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007 dp[i] dp i (dp[i-1]+dp[i-2])%1_000_000_007 (dp[i-1]+dp[i-2]) dp[i-1] dp i-1 i 1 dp[i-2] dp i-2 i 2 1_000_000_007 System.out.println(dp[n]) System.out.println System.out System System.out dp[n] dp n String[] args args public class Main {
	
	

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		

		int n = sc.nextInt();
		int m = sc.nextInt();
		boolean[] broken = new boolean[n+1];
		
		for (int i=0;i<m;i++) {
			broken[sc.nextInt()]=true;
		}
		
		long[] dp = new long[n+1];
		dp[0]=1;
		
		for (int i=1;i<=n;i++) {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		}
		System.out.println(dp[n]);
	}
} public class Main {
	
	

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		

		int n = sc.nextInt();
		int m = sc.nextInt();
		boolean[] broken = new boolean[n+1];
		
		for (int i=0;i<m;i++) {
			broken[sc.nextInt()]=true;
		}
		
		long[] dp = new long[n+1];
		dp[0]=1;
		
		for (int i=1;i<=n;i++) {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		}
		System.out.println(dp[n]);
	}
} Main

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();
		boolean[] broken = new boolean[n+1];
		
		for (int i=0;i<m;i++) {
			broken[sc.nextInt()]=true;
		}
		
		long[] dp = new long[n+1];
		dp[0]=1;
		
		for (int i=1;i<=n;i++) {
			if (broken[i]) {
				dp[i]=0;
			} else {
				if (i==1) {
					dp[i]=1;
				} else {
					dp[i]=(dp[i-1]+dp[i-2])%1_000_000_007;
				}
			}
		}
		System.out.println(dp[n]);
	}
}