package src;

import java.math.BigInteger;
import java.util.*;
class B{
	static Scanner s = new Scanner(System.in);
	static final int mod=1000000007;
	public static void main(String[] args){
		int n=s.nextInt();
		BigInteger[] in = new BigInteger[s.nextInt()];
		for(int i=0;i<in.length;i++)
			in[i]=s.nextBigInteger();
		Arrays.sort(in);
		{
			BigInteger b = BigInteger.ZERO;
			for(BigInteger bb:in) {
				b=b.or(bb);
				if(b.xor(bb).getLowestSetBit()!=-1) {
					System.out.println(0);
					return;
				}
			}
		}
		{
			int r=1;
			int b=0;
			for(BigInteger bb:in) {
				r*=getFactorial(bb.bitCount()-b, mod);
				b=bb.bitCount();
			}
			r*=getFactorial(n-b,mod);
			System.out.println(r);
		}
	}
	static int getFactorial(long value,int mod) {
		if(value==0||value==1)
			return 1;
		if(value==2)
			return 2;
		return g(value,value-1,mod);
	}
	static int g(long v,long i,int m) {
		if(i==2)
			return (int) ((v*2)%m);
		return g(v*i,i-1,m);
	}
}