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 Ruby (2.3.3) (judge verdict: Time Limit Exceeded)

# util functions

# debug
$debugFlag = ( ARGV[0] != nil )
p "==== DEBUG MODE ====" if $debugFlag

def pd(str)
  p str if $debugFlag
end

def printd(str)
  print str if $debugFlag
end

# input
inputs = []
lc = 0
nn = 0
as = []
bef = 0
end_flag = false
while l = $stdin.gets do
  if lc == 0
    nn = l.chomp.split(" ").map(&:to_i)[0]
  else
    xx = l.chomp.split(" ").map(&:to_i)[0]
    if xx - bef == 1 and bef != 0
      end_flag = true
      break
    end
    as << xx
    bef = xx
  end
  lc += 1
end

if end_flag
  puts 0
  exit
end

# input check
if $debugFlag
  p "--- INPUT (begin) ---"
  inputs.each do |l_i|
    p l_i
  end
  p "--- INPUT (end) ---"
  print "\n"
end

# body
if $debugFlag
  p nn
  p as
end

as << (nn + 1)

lst = []
tmp = 0
as.length.times do |i|
  if i == 0
    lst << as[i] - 1
  else
    lst << as[i] - tmp - 2
  end
  tmp = as[i]
end

pd lst

def comb(n, m)
  return 1 if n == 0 or m == 0
  
  ret = 1
  div = 1
  m.times do |i|
    ret *= (n - i)
    div *= (i + 1)
  end
  return ret/div
end

combs = 1
lst.each do |l_i|
  ynum = l_i/2
  tmp_comb = 0
  (ynum+1).times do |y|
    x = l_i - 2*y
    ind = [x, y].min
    tmp_comb += comb(x + y, ind)
  end
  combs *= tmp_comb
end

puts (combs % 1000000007)