n, k = gets.strip.split(' ').map(&:to_i)
if k == 0
	a = []
else
	a = gets.strip.split(' ').map(&:to_i)
end

def fact(n)
	return 1 if n == 0 || n == 1
	return n * fact(n - 1)
end

def permutation(n, k)
	return fact(n) / fact(k)
end

b = a.sort{|x, y| x.to_s(2).count('1') <=> y.to_s(2).count('1')}
(0...b.length - 1).each do |i|
	(0...b[i].to_s(2).length).each do |j|
		if b[i].to_s(2)[-j - 1] == '1' && b[i + 1].to_s(2)[-j - 1] == '0'
			p 0
			exit
		end
	end
end

bit_num = []
a.each do |ai|
	bit_num << ai.to_s(2).count('1')
end
if bit_num.length != bit_num.uniq.length
	puts "choufuku"
	p 0
	exit
end
bit_num += [0, n]
bit_num.uniq!.sort!

ans = 1
(0...bit_num.length - 1).each do |i|
	ans *= permutation(bit_num[i + 1] - bit_num[i], 1) % (10**9 + 7)
end
p ans