import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.*; public class Main { void solve() throws IOException { int n = ni(), k = ni(); long[] a = new long[k + 2]; for (int i = 0; i < k; i++) { a[i] = nl(); } a[k] = 0; a[k + 1] = (1L << n) - 1; Arrays.sort(a); long MOD = 1000000007; long[] p = new long[61]; p[0] = 1; for (int i = 1; i < 61; i++) { p[i] = (p[i - 1] * i) % MOD; } int[] d = new int[k + 1]; for (int i = 0; i < k + 1; i++) { if ((a[i] | (a[i + 1] - a[i])) != a[i + 1]) { out.println(0); return; } d[i] = Long.bitCount(a[i + 1]) - Long.bitCount(a[i]); } long ans = 1; for (int i = 0; i < k + 1; i++) { ans = (ans * p[d[i]]) % MOD; } out.println(ans); } String ns() throws IOException { while (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine(), " "); } return tok.nextToken(); } int ni() throws IOException { return Integer.parseInt(ns()); } long nl() throws IOException { return Long.parseLong(ns()); } double nd() throws IOException { return Double.parseDouble(ns()); } String[] nsa(int n) throws IOException { String[] res = new String[n]; for (int i = 0; i < n; i++) { res[i] = ns(); } return res; } int[] nia(int n) throws IOException { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = ni(); } return res; } long[] nla(int n) throws IOException { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nl(); } return res; } static BufferedReader in; static PrintWriter out; static StringTokenizer tok; public static void main(String[] args) throws IOException { in = new BufferedReader(new InputStreamReader(System.in)); out = new PrintWriter(System.out); tok = new StringTokenizer(""); Main main = new Main(); main.solve(); out.close(); } }