#include <bits/stdc++.h>
//#define int long long
#define fi first
#define se second 
#define pb push_back
#define ott(i, l, r) for (register int i = l; i <= r; ++ i)
#define tto(i, l, r) for (register int i = r; i >= l; -- i)
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
inline int read () {
	int x = 0; bool f = false; char c = getchar ();
	while (!isdigit (c)) f |= (c == '-'), c = getchar ();
	while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
	return x = f ? -x : x;
}
const int N = 11, M = 6561, mod = 998244353, inf = 0x3f3f3f3f;
int n, m, k, res; char ch[N];
int po3[N], f[N][M];
bitset <N> ok[M][2];
vector <int> sta[N];
map <char, int> id;
int main () {
	n = read (), m = read (), id['I'] = 0, id['C'] = 1, id['P'] = 2;
	po3[0] = 1; ott (i, 1, m) po3[i] = 3 * po3[i - 1];
	res = 1; ott (i, 1, n) {
		scanf ("%s", ch);
		ott (j, 0, m - 1)
			if (!(ch[j] ^ '?')) res = 3ll * res % mod;
		ott (s, 0, po3[m] - 1) {
			bool fl = true;
			ott (j, 0, m - 1) 
				if (ch[j] ^ '?' && id[ch[j]] ^ (s / po3[j] % 3)) {
					fl = false; break;
				}
			if (fl) sta[i].pb (s);
		}
	}
	ott (s, 0, po3[m] - 1)
		ott (j, 0, m - 2) {
			if (s / po3[j] % 3 == 0 && s / po3[j + 1] % 3 == 1) ok[s][0].set (j);
			if (s / po3[j] % 3 == 2 && s / po3[j + 1] % 3 == 1) ok[s][1].set (j);
		}
	for (int &s : sta[1]) f[1][s] = 1;
	ott (i, 1, n - 1) {
		for (int &s : sta[i])
			for (int &t : sta[i + 1])
			    if (!(ok[s][0] & ok[t][1]).any ())
			    	(f[i + 1][t] += f[i][s]) %= mod;
	}
	ott (s, 0, po3[m] - 1) (res += mod - f[n][s]) %= mod;
	printf ("%d\n", res);
	return 0;
}