import 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();

        int dp[] = new int[n+2];
        boolean stairs[] = new boolean[n+1];
        dp[0] = 0;
        dp[1] = 1;


        int a[] = new int[m];

        for (int i=0; i<m; i++){
            a[i] = sc.nextInt();
            stairs[a[i]] = true;
        }

        for (int j=0; j<n; j++) {
            if (stairs[j+1]) {
                dp[j]=0;
                continue;
            }
            else{
                dp[j + 2] = (dp[j + 1] + dp[j]) % 1000000007;
            }
        }

        System.out.println(dp[n+1]);

    }
}


/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