package yukicoder; import java.util.*; public class Q462 { final static long MODULO = 1_000_000_000 + 7; public static void main(String[] args) { long[] fac = new long[100]; long[] invfac = new long[100]; fac[0] = 1; for (int i = 1; i < 100; ++i) { fac[i] = fac[i - 1] * i % MODULO; } invfac[99] = pow(fac[99], MODULO - 2); for (int i = 98; i >= 0; --i) { invfac[i] = invfac[i + 1] * (i + 1) % MODULO; } Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int k = sc.nextInt(); if (k == 0) { System.out.println(fac[n] % MODULO); return; } long[] a = new long[k]; long[] diff = new long[k + 1]; for (int i = 0; i < k; ++i) { a[i] = sc.nextLong(); } for (int i = 0; i + 1 < k; ++i) { diff[i + 1] = count(a[i], a[i + 1]); if (diff[i + 1] < 0) { System.out.println(0); return; } } diff[0] = count(0, a[0]); diff[k] = count(a[k - 1], (1L << n) - 1); long ans = 1; for (int i = 0; i < k + 1; ++i) { ans = (ans * fac[(int) diff[i]]) % MODULO; } System.out.println(ans); } static long count(long min, long max) { for (int i = 0; i < 63; ++i) { if ((min & (1L << i)) > 0 && (max & (1L << i)) == 0) { return -1; } } int diff = Long.bitCount(max) - Long.bitCount(min); return diff; } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } static long pow(long a, long n) { long ret = 1; for (; n > 0; n >>= 1, a = (a * a) % MODULO) { if (n % 2 == 1) { ret = (ret * a) % MODULO; } } return ret; } }