import java.util.ArrayList;
import java.util.Scanner;
import java.util.TreeMap;

public class Muikashirazu {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int N = s.nextInt(),k = s.nextInt(),cut = (int)(Math.pow(10, 9) + 7);
		if(k == 0){
			long p = 1;
			for(int i = 1;i <= N;i++){
				p *= (long)i;
				p %= cut;
			}
			System.out.println(p);
		}else{
			long count = 1;
			TreeMap<Integer,String> bit = new TreeMap<>();
			for(int i = 0;i < k;i++){
				long a = s.nextLong();
				int b = bitcount(a);
				if(bit.containsKey(b)){
					count = 0;
				}else{
					bit.put(b, binaryString(a));
				}
			}
			s.close();
			//System.out.println(bit);
			//System.out.println(count);
			int n = 1;
			String str = "", str2; 
			for(int i = 1;i <= bit.lastKey();i++){
				str2 = bit.get(i);
				if(str != "" && str2 != null){
					//System.out.println(str + "  " + str2);
					ArrayList<Integer> p = new ArrayList<>();
					for(int j = 0;j<str.length();j++){
						if(str.charAt(j) == '1'){
							p.add(str.length()-j);
						}
					}
					int t = 0;
					for(int a:p){
						if(str2.charAt(str2.length()-a) != '1'){
							t--;
						}
					}
					if(t == 0){
						int cnt = 1;
						for(int k2 = 1;k2 <= i-n;k2++){
							cnt *= k2;
							cnt %= cut;
						}
						count *= cnt;
						//System.out.println(count);
					}else{
						count = 0;
						break;
					}
					str = new String(str2);
					n = i;
				}else if(str == "" && str2 != null){
					str = new String(str2);
					n = i;
					//System.out.println(str + "  " + str2);
				}
			}
			int p = 1;
			for(int i = 1;i <= N-bit.lastKey();i++){
				p *= i;
			}
			count *= p;
			System.out.println(count%cut);
		}
	}
	static int bitcount(long a){
		int b = 0;
		while(a != 0){
			if(a%2 == 1){
				b++;
			}
			a /= 2;
		}
		return b;
	}
	static String binaryString(long a){
		StringBuilder b = new StringBuilder();
		while(a != 0){
			b.append(a%2);
			a /= 2;
		}
		return b.toString();
	}

}