import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        final int MOD = 1000000007;
        final Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();
        final int[] a = new int[N+1];
        for (int i = 0; i < M; i++) {
            a[scanner.nextInt()] = -1;
        }
        a[0] = 1;
        for (int i = 0; i < a.length; i++) {
            if (a[i] == -1) continue;
            if (i+1 < a.length && a[i+1] != -1)
                a[i + 1] = (a[i] + a[i + 1]) % MOD;
            if (i+2 < a.length && a[i+2] != -1) {
                a[i + 2] = (a[i] + a[i + 2]) % MOD;
            }
        }
        System.out.println(a[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