#include <bits/stdc++.h>
using namespace std;

int n, k, a[10], used[10], ans;
string s[10];

void dfs(int idx) {
	if (idx == n * n + 1) {
		for (int i = 1; i <= k; ++i) {
			if (!used[i]) {
				return;
			}
		}
		
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= n; ++j) {
				if (s[i][j] == 'O') {
					return;
				}
			}
		}
		
		ans++;
		
		return;
	}
	
	int r = (idx - 1) / n + 1;
	int c = (idx - 1) % n + 1;
	
	dfs(idx + 1);
	
	if (s[r][c] == 'X' || s[r][c] == 'S') {
		return;
	}
	
	for (int i = 1; i <= k; ++i) {
		if (!used[i]) {
			if (c + a[i] - 1 <= n) {
				bool fail = 0;
				for (int j = c; j <= c + a[i] - 1; ++j) {
					if (s[r][j] == 'X' || s[r][j] == 'S') {
						fail = 1;
						break;
					}
				}
				if (!fail) {
					vector<char> mem(10);
					for (int j = c; j <= c + a[i] - 1; ++j) {
						mem[j] = s[r][j];
						s[r][j] = 'S';
					}
					used[i] = 1;
					dfs(idx + 1);
					used[i] = 0;
					for (int j = c; j <= c + a[i] - 1; ++j) {
						s[r][j] = mem[j];
					}
				}
			}
			
			if (a[i] != 1 && r + a[i] - 1 <= n) {
				bool fail = 0;
				for (int j = r; j <= r + a[i] - 1; ++j) {
					if (s[j][c] == 'X' || s[j][c] == 'S') {
						fail = 1;
						break;
					}
				}
				if (!fail) {
					vector<char> mem(10);
					for (int j = r; j <= r + a[i] - 1; ++j) {
						mem[j] = s[j][c];
						s[j][c] = 'S';
					}
					used[i] = 1;
					dfs(idx + 1);
					used[i] = 0;
					for (int j = r; j <= r + a[i] - 1; ++j) {
						s[j][c] = mem[j];
					}
				}
			}
		}
	}
}

int main() {
	cin >> n >> k;
	for (int i = 1; i <= n; ++i) {
		cin >> s[i];
		s[i] = "@" + s[i];
	}
	
	for (int i = 1; i <= k; ++i) {
		cin >> a[i];
	}
	
	dfs(1);
	
	cout << ans << endl;
	
	return 0;
}