#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef unsigned int uint;
typedef pair <int, int> pii;
const int N = 65537, M = 1005, w[] = {3, 3, 3, 2, 3, 2, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1};
int n, m, n1, n2, len[M], popcnt[N], p2[N], p3[N], f[N][4], ans, prod[N][2], dp[33][N][2];
uint mask[M][4]; char str[105], s[M][105];
inline int PLUS(int x, int y) {
	x += y;
	return x >= MOD ? x - MOD : x;
}
inline void Insert(int s0, int s1, int s2, int s3) {
	s2 ^= s0 | s1 | s3;
	f[s0][0] ++, f[s1][0] ++, f[s3][0] ++, f[s2][1] ++;
	f[s0|s1][2] ++, f[s1|s3][2] ++, f[s0|s2][3] ++, f[s2|s3][3] ++;
}
inline void FMT(int n) {
	for (int i=0; i<n; i++)
		for (int j=1; j<1<<n; j++)
			if (j & 1 << i)
				for (int k=0; k<=3; k++)
					f[j ^ 1 << i][k] += f[j][k];
}
#define Get(i) 1ll * p3[f[i][0] + f[i][1]] * p2[f[i][2] + f[i][3] - (f[i][0] + f[i][1] << 1)] % MOD
#define trans(_i, _j, _k, cj, ck) \
	dp[_i][_j][_k] = (dp[_i][_j][_k] + 1ll * dp[i][j][k] * prod[cj][ck]) % MOD, \
	dp[_i][_j|1][_k] = (dp[_i][_j|1][_k] + 1ll * (MOD - dp[i][j][k]) * prod[cj|1][ck]) % MOD
int main() {
	cin >> n >> m, n1 = max(n, 2) >> 1, n2 = n - n1, p2[0] = p3[0] = 1;
	for (int i=1; i<=n*m; i++)
		p2[i] = PLUS(p2[i-1], p2[i-1]), p3[i] = PLUS(p3[i-1], PLUS(p3[i-1], p3[i-1]));
	for (int i=1; i<1<<max(n1,n2); i++)
		popcnt[i] = popcnt[i>>1] + (i & 1);
	for (int i=1; i<=m; i++) {
		scanf ("%s", str);
		s[i][len[i]=1] = 2;
		for (auto j : str) {
			if (! j) break;
			isdigit(j) ? s[i][len[i]] = (j - '0') * 3 : j == '*' ? s[i][len[i]] ^= 3 : s[i][++len[i]] = 2;
		}
		if (len[i] > n) continue;
		for (int j=1; j<=len[i]; j++)
			mask[i][s[i][j]] |= 1u << j - 1;
		int lim = (1 << n1) - (1 << n1 - min(n1, n - len[i] + 1));
		for (int j=1; j<=n1; j++)
			Insert(mask[i][0] << n1 - j & lim, mask[i][1] << n1 - j & lim, lim, mask[i][3] << n1 - j & lim);
		for (int j=n1+1; j<=n; j++)
			Insert(mask[i][0] >> j - n1 & lim, mask[i][1] >> j - n1 & lim, lim, mask[i][3] >> j - n1 & lim);
	} FMT(n1);
	for (int i=1; i<1<<n1; i++) {
		int _ = Get(i);
		ans = PLUS(ans, popcnt[i] & 1 ? _ : MOD - _);
		for (int j=0; j<=3; j++)
			f[i][j] = 0;
	}
	for (int l=1; l<=n2; l++) {
		int cnt = 0, lim = (1 << l) - 1;
		for (int i=1; i<=m; i++)
			if (len[i] <= l) {
				++ cnt;
				Insert(mask[i][0] & lim, mask[i][1] & lim, lim, mask[i][3] & lim);
			}
		if (! cnt) continue;
		FMT(l);
		for (int i=1; i<1<<l; i++) {
			prod[i][0] = Get(i), prod[i][1] = 1ll * p3[f[i][1]] * p2[f[i][3] - (f[i][1] << 1)] % MOD;
			for (int j=0; j<=3; j++)
				f[i][j] = 0;
		}
		prod[0][0] = prod[0][1] = p3[cnt];
		for (int i=1; i<=n-l+2; i++)
			for (int j=0; j<1<<l-1; j++)
				dp[i][j][0] = dp[i][j][1] = 0;
		dp[1][0][0] = 1; lim >>= 1;
		if (l == 1) {
			for (int i=1; i<n; i++)
				dp[i+1][0][0] = 1ll * dp[i][0][0] * prod[0][1] % MOD, 
				dp[i+1][0][1] = (1ll * (MOD - dp[i][0][0]) * prod[1][1] + 1ll * dp[i][0][1] * (prod[0][1] + MOD - prod[1][1])) % MOD;
			ans = (ans + 1ll * dp[n][0][0] * prod[1][0] + 1ll * dp[n][0][1] * prod[1][1]) % MOD;
		} else {
			for (int i=1; i<=n-l+1; i++)
				for (int j=0; j<1<<min(i,l)-1; j++)
					for (int k=0; k<=1; k++)
						if (dp[i][j][k])
							trans(i + 1, j << 1 & lim, k | (bool) (j & 1 << l - 2), j << 1, k | (i != n - l + 1));
			for (int j=1; j<=lim; j+=2)
				for (int k=0; k<=1; k++)
					if (dp[n-l+2][j][k]) {
						int c = 1, _j = j, _k = k;
						for (int i=n-l+2; i<=n; i++)
							c = 1ll * c * prod[_j<<1][_k] % MOD, _k |= (bool) (_j & 1 << l - 2), (_j <<= 1) &= lim;
						ans = (ans + 1ll * c * (MOD - dp[n-l+2][j][k])) % MOD;
					}
		}
	} return cout << ans << endl, 0;
}