#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define bs bitset < N >
using namespace std;
const int N = 2007, mod = 998244353;
int n, m;
char s[N][N];
int gen[N], tp;
inline bool canput(int x, int y) {
	if(s[x][y] == '1' || s[x][y + 2] == '1' || s[x + 2][y] == '1' || s[x + 2][y + 2] == '1') 
		return 0;
	if((s[x + 1][y] - '0') + (s[x][y + 1] - '0') + 
		(s[x + 1][y + 2] - '0') + (s[x + 2][y + 1] - '0') > 1) return 0;
	return 1;
}
vector < pair < int, int > > rt[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	L(i, 1, n) {
		cin >> (s[i] + 1);
	}
	auto put = [&] (int x, int y) {
		if(x < 1 || x > n || y < 1 || y > m || s[x][y] == '1') {
			cout << "0" << endl;
			exit(0);
		}
		s[x][y] = '1';
		return ;
	};
	int ans = 1;
	L(sum, 2, n + m) {
		for(auto u : rt[sum]) {
			int x1 = u.first, y1 = sum - x1;
			int x2 = u.second, y2 = sum - x1;
			if(canput(x1, y1)) {
				s[x2][y2] = 1;
			} else {
				s[x1][y1] = 1;
			}
		}
		tp = 0;
		L(i, 1, n) {
			int j = sum - i;
			if(1 <= j && j <= m && s[i][j] == '0') {
				gen[++tp] = i;
				put(i, j);
				put(i, j + 2);
				put(i + 2, j + 2);
				put(i + 2, j);
			}
		}
		L(i, 1, tp) {
			int x = gen[i];
			int y = sum - gen[i];
			if(gen[i] + 1 == gen[i + 1]) {
				put(x, y + 1);
				put(x + 1, y);
				put(x + 1, y + 2);
				put(x + 2, y - 1);
				put(x + 2, y + 1);
				put(x + 3, y);
				ans = (ll) ans * 2 % mod;
				++i;
			} else {
				vector < pair < int, int > > VC;
				VC.emplace_back(x, y + 1);
				VC.emplace_back(x + 1, y);
				VC.emplace_back(x + 1, y + 2);
				VC.emplace_back(x + 2, y + 1);
				int ok = 0;
				L(p, 0, 3) {
					if(s[VC[p].first][VC[p].second] == '1') {
						ok = 1;
						L(i, 0, 3) 
							if(i != p) 
								put(VC[i].first, VC[i].second);
						break;
					}
				} 
				if(ok) continue;
				put(x + 1, y);
				put(x, y + 1);
				if(s[x + 1][y + 1] == '0') {
					put(x + 1, y + 1);
					put(x + 2, y + 1);
					put(x + 1, y + 2);
					put(x + 1, y + 3);
					put(x + 2, y + 3);
					put(x + 3, y + 1); 
					put(x + 3, y + 2);
					put(x + 3, y + 3);
					ans = (ll) ans * 2 % mod;
				} else {
					rt[sum + 3].emplace_back(x + 1, x + 2);
				}
			}
		}
	}
	cout << ans << '\n';
	return 0;
}