#include<bits/stdc++.h>
using namespace std;
const int maxn = 1005, mod = 998244353;
const int step[4][7][2] =  {{{0, 0}, {0, 1}, {0, 2}, {1, 0}, {1, 2}, {2, 0}, {2, 2}}, 
							{{0, 0}, {2, 1}, {0, 2}, {1, 0}, {1, 2}, {2, 0}, {2, 2}}, 
							{{0, 0}, {0, 1}, {0, 2}, {2, 1}, {1, 2}, {2, 0}, {2, 2}}, 
							{{0, 0}, {0, 1}, {0, 2}, {1, 0}, {2, 1}, {2, 0}, {2, 2}}};
int Add(int x, int y) {
	return (x += y) >= mod ? x - mod : x;
}
int Mul(int x, int y) {
	return 1ll * x * y % mod;
}
int n, m;
char s[maxn][maxn];
int Canput(int x, int y, int k) {
	if(x < 1 || y < 1)
		return 0;
	if(x + 2 > n || y + 2 > m)
		return 0;
	if(s[x + 1][y + 1] == '0')
		return 0;
	for(int i = 0; i < 7; ++ i) {
		int nx = x + step[k][i][0], ny = y + step[k][i][1];
		if(s[nx][ny] == '1')
			return 0;
	}
	return 1;
}
void Put(int x, int y, int k, char c) {
	for(int i = 0; i < 7; ++ i) {
		int nx = x + step[k][i][0], ny = y + step[k][i][1];
		s[nx][ny] = c;
	}
}
int Solve(int x, int y, int ans) {
// cerr << x << " " << y << " " << ans << " " << s[x][y] << endl;
// for(int i = 1; i <= n; ++ i, cerr << endl)
// 	for(int j = 1; j <= m; ++ j)
// 		cerr << s[i][j];
	if(!ans)
		return 0;
	if(x == n + 1)
		return ans;
	if(s[x][y] == '1')
		return Solve(x + (y == m), y == m ? 1 : y + 1, ans);
	if(x >= n - 1 || y >= m - 1)
		return 0;
	if(s[x + 2][y] == '1' || s[x][y + 2] == '1' || s[x + 2][y + 2] == '1')
		return 0;
	long long res = 0;
	if(s[x + 1][y + 1] == '0') {
		int f = 1;
		for(int i = 0; i < 3 && f; ++ i)
			for(int j = 0; j < 3 && f; ++ j)
				if(s[x + i][y + j] == '1')
					f = 0; // , cerr << x + i << " " << y + j << endl;
		if(!f)
			return 0;
		f = 0;
// cerr << s[x + 1][y - 1] << " " << s[x + 2][y - 1] << " " << s[x + 3][y - 1] << " " << s[x + 3][y] << " " << s[x + 3][y + 1] << endl;
		if(y > 1 && x + 3 <= n && s[x + 1][y - 1] == '0' && s[x + 2][y - 1] == '0' && s[x + 3][y - 1] == '0' && s[x + 3][y] == '0' && s[x + 3][y + 1] == '0') {
			f |= 1;
		}
		if(y + 3 <= m && x + 3 <= n && s[x + 1][y + 3] == '0' && s[x + 2][y + 3] == '0' && s[x + 3][y + 3] == '0' && s[x + 3][y + 2] == '0' && s[x + 3][y + 1] == '0') {
			f |= 2;
		}
		if(f == 1) {
			Put(x, y, 2, '1');
			Put(x + 1, y - 1, 3, '1');
			res = Solve(x + (y == m), y == m ? 1 : y + 1, Add(ans, ans));
			Put(x, y, 2, '0');
			Put(x + 1, y - 1, 3, '0');
		}
		else if(f == 2) {
			Put(x, y, 3, '1');
			Put(x + 1, y + 1, 2, '1');
			res += Solve(x + (y == m), y == m ? 1 : y + 1, Add(ans, ans));
			Put(x, y, 3, '0');
			Put(x + 1, y + 1, 2, '0');
		}
		else if(f == 3) {
			if(Canput(x + 1, y - 3, 0) && Canput(x + 3, y - 2, 1)) {
				Put(x, y, 3, '1');
				Put(x + 1, y + 1, 2, '1');
				Put(x + 1, y - 3, 0, '1');
				Put(x + 3, y - 2, 1, '1');
				res += Solve(x + (y == m), y == m ? 1 : y + 1, Add(ans, ans));
				Put(x, y, 3, '0');
				Put(x + 1, y + 1, 2, '0');
				Put(x + 1, y - 3, 0, '0');
				Put(x + 3, y - 2, 1, '0');
			}
			else {
				Put(x, y, 2, '1');
				Put(x + 1, y - 1, 3, '1');
				res = Solve(x + (y == m), y == m ? 1 : y + 1, Add(ans, ans));
				Put(x, y, 2, '0');
				Put(x + 1, y - 1, 3, '0');
			}
		}
		return res % mod;
	}
	else {
		int k = -1;
		if(s[x][y + 1] == '1') {
			if(k == -1)
				k = 1;
			else
				k = -2;
		}
		if(s[x + 2][y + 1] == '1') {
			if(k == -1)
				k = 0;
			else
				k = -2;
		}
		if(s[x + 1][y] == '1') {
			if(k == -1)
				k = 2;
			else
				k = -2;
		}
		if(s[x + 1][y + 2] == '1') {
			if(k == -1)
				k = 3;
			else
				k = -2;
		}
		if(k == -2)
			return 0;
		if(k != -1) {
			Put(x, y, k, '1');
			res += Solve(x + (y == m), y == m ? 1 : y + 1, ans);
			Put(x, y, k, '0');
		}
		else { // 8 empty.
			for(k = 0; k < 4; ++ k) {
				if(k == 1)
					continue;
				if(k == 3 && Canput(x + 1, y + 2, 2)) {
					Put(x, y, k, '1');
					res += Solve(x + (y == m), y == m ? 1 : y + 1, ans);
					Put(x, y, k, '0');
				}
				if(k == 0) {
					int f = 0;
					if(Canput(x + 2, y + 1, 1))
						f |= 1;
					if(Canput(x + 2, y - 1, 1))
						f |= 2;
					if(f == 1) {
						Put(x, y, k, '1');
						Put(x + 2, y + 1, 1, '1');
						res += Solve(x + (y == m), y == m ? 1 : y + 1, ans);
						Put(x, y, k, '0');
						Put(x + 2, y + 1, 1, '0');
					}
					else if(f == 2) {
						Put(x, y, k, '1');
						Put(x + 2, y - 1, 1, '1');
						res += Solve(x + (y == m), y == m ? 1 : y + 1, ans);
						Put(x, y, k, '0');
						Put(x + 2, y - 1, 1, '0');
					}
					else {
						if(y > 1 && s[x + 1][y - 1] == '0') {
							Put(x, y, k, '1');
							Put(x + 2, y + 1, 1, '1');
							res += Solve(x + (y == m), y == m ? 1 : y + 1, ans);
							Put(x, y, k, '0');
							Put(x + 2, y + 1, 1, '0');
						}
						else if(Canput(x + 2, y - 3, 0) && Canput(x + 4, y - 2, 0)) {
							Put(x, y, k, '1');
							Put(x + 2, y + 1, 1, '1');
							Put(x + 2, y - 3, 0, '1');
							Put(x + 4, y - 2, 1, '1');
							res += Solve(x + (y == m), y == m ? 1 : y + 1, ans);
							Put(x, y, k, '0');
							Put(x + 2, y + 1, 1, '0');
							Put(x + 2, y - 3, 0, '0');
							Put(x + 4, y - 2, 1, '0');
						}
						else {
							Put(x, y, k, '1');
							Put(x + 2, y - 1, 1, '1');
							res += Solve(x + (y == m), y == m ? 1 : y + 1, ans);
							Put(x, y, k, '0');
							Put(x + 2, y - 1, 1, '0');
						}
					}
				}
				if(k == 2 && Canput(x + 1, y - 2, 3)) {
					Put(x, y, k, '1');
					res += Solve(x + (y == m), y == m ? 1 : y + 1, ans);
					Put(x, y, k, '0');
				}
			}
		}
		return res % mod;
	}
	return res % mod;
}
int main() {
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; ++ i)
		scanf("%s", s[i] + 1);
	printf("%d\n", Solve(1, 1, 1) % mod);
}