Problem:
Score : 300 points

Problem Statement

There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.
He can climb up one or two steps at a time.

However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.

How many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?
Find the count modulo 1\ 000\ 000\ 007.

Constraints

1 \leq N \leq 10^5

0 \leq M \leq N-1

1 \leq a_1 < a_2 < ... < a_M \leq N-1

Input

Input is given from Standard Input in the following format:

N M
a_1
a_2
.
.
.
a_M

Output

Print the number of ways to climb up the stairs under the condition, modulo 1\ 000\ 000\ 007.

Sample Input 1

6 1
3

Sample Output 1

4

There are four ways to climb up the stairs, as follows:

0 \to 1 \to 2 \to 4 \to 5 \to 6

0 \to 1 \to 2 \to 4 \to 6

0 \to 2 \to 4 \to 5 \to 6

0 \to 2 \to 4 \to 6

Sample Input 2

10 2
4
5

Sample Output 2

0

There may be no way to climb up the stairs without setting foot on the broken steps.

Sample Input 3

100 5
1
23
45
67
89

Sample Output 3

608200469

Be sure to print the count modulo 1\ 000\ 000\ 007.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

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 flag = 1;
      int ans;

      int[] a = new int[m+1];
      for(int i=1;i<m+1;i++){
        a[i]=sc.nextInt();
      }

      //////////ERROR//////////////////////
      for(int i=1;i<m;i++){
        if(a[i+1]==a[i]+1){
          flag = 0;
          break;
        }
      }
      ////////////////////////////////////
      int[] way = new int[n+1];
      if(flag==1){

      if(n==1){
        way[n] = 1;
      }
      else if(n==2){
        way[n] = 2;
      }
      else{
/////////////////////////main////////////////////////////////////////
        if(a[1]!=1){
          way[1] = 1;
        }
        else{
          way[1] = 0;
        }

        if(a[1]!=2 || a[2]!=2){
          way[2] = 2;
        }
        else{
          way[2] = 0;
        }

        int ccnt=0;
        for(int i=3;i<n+1;i++){
          for(int j=ccnt;j<m+1;j++){
            if(way[i]==a[j]){
              way[i] = -1;
              ccnt++;
              break;
            }
          }
        }

        for(int i=3;i<n+1;i++){
          if(way[i]!=-1){
            way[i] = way[i-1] + way[i-2];
          }
          else{
            way[i] = 0;
          }
        }


/////////////////////////////////////////////////////////////////////
      }



    }


    ans = way[n] % 1000000007;


      if(flag==0){
        System.out.println("0");
      }
      else{
        System.out.println(ans);
      }

    }
}