#include <bits/stdc++.h>

using namespace std;

const int N = 1e4 + 5, S = 19;

int n, K, f[1 << S], g[1 << S][S + 1];

char A[25], B[25];

bool no[S][26];
int st[26];

bool ok = 1;

int Eq[26], Ge[26];


const int P = 1e9 + 7;

void add(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}

void sv() {
	int s = 0;
	for (int i = 0; i < 26; i++) {
		Ge[i] = max(Ge[i], Eq[i]);
		s += Ge[i];
	}
	if (s > K) {
		puts("0");
		return;
	}
	f[0] = 1;
	for (int c = 0; c < 26; c++) {
		if (Eq[c] == -1 && Ge[c] == 0) {
			for (int u = 0; u < K; u++) {
				if (st[u] != -1 && st[u] != c) continue;
				if (no[u][c]) continue;
				for (int i = ((1 << K) - 1); i >= 0; i--) {
					if (!f[i]) continue;
					if (i >> u & 1) continue;
					add(f[i | (1 << u)], f[i]);
				}
			}
			continue;
		}
		int R = K;
		for (int i = 0; i < 26; i++)
			if (i != c) R -= Ge[i];
		if (Eq[c] != -1) R = min(R, Eq[c]);

		for (int i = 0; i < (1 << K); i++)
			g[i][0] = f[i], f[i] = 0;
		for (int u = 0; u < K; u++) {
			if (st[u] != -1 && st[u] != c) continue;
			if (no[u][c]) continue;
			for (int j = R - 1; j >= 0; j--) {
				for (int i = 0; i < (1 << K); i++) {
					if (!g[i][j]) continue;
					if (i >> u & 1) continue;
					
					add(g[i | (1 << u)][j + 1], g[i][j]);
				}
			}
		}

		for (int i = 0; i < (1 << K); i++) {
			for (int j = 0; j <= R; j++) {
				if (!g[i][j]) continue;
				if (Eq[c] != -1 && Eq[c] != j) continue;
				if (j < Ge[c]) continue;
				//cout << c << " " << i << " " << j << " awa " << g[i][j] << endl;
				add(f[i], g[i][j]);
			}
		}

		for (int i = 0; i < (1 << K); i++) {
			for (int j = 0; j <= K; j++) {
				g[i][j] = 0;
			}
		}
	}
	printf("%d\n", f[(1 << K) - 1]);	
}

void wk() {
	scanf("%s%s", A, B);
	for (int i = 0; i < K; i++) {
		int c = A[i] - 'A';
		if (B[i] == 'O') {
			if (st[i] != -1 && st[i] != c) {
				ok = 0;
			}
			st[i] = c;
		} else if (B[i] == 'x') {
			int num = 0;
			for (int j = 0; j < K; j++) {
				if (A[j] == A[i]) {
					if (B[j] == 'O') {
						num++;
					} else if (j < i) {
						if (B[j] == '-') num++;
					}
				}

			}
			if (Eq[c] != -1 && Eq[c] != num) ok = 0;
			Eq[c] = num;
			no[i][c] = 1;
		} else if (B[i] == '-') {
			int num = 1;
			for (int j = 0; j < K; j++) {
				if (A[j] == A[i]) {
					if (B[j] == 'O') {
						num++;
					} else if (j < i) {
						if (B[j] == '-') num++;
						else if (B[j] == 'x') {
							ok = 0;
						}
					}
				}
			}
			no[i][c] = 1;
			Ge[c] = max(Ge[c], num);
		}
	}
}


int main() {
	memset(Eq, -1, sizeof Eq);
	memset(st, -1, sizeof st);
	scanf("%d%d", &n, &K); 
	for (int i = 1; i <= n; i++) wk();
	if (!ok) puts("0");
	else sv();
}