#include<bits/stdc++.h>

#define HEAP priority_queue
#define rep(i, n) for(int i = 0, _end_ = (n); i < _end_; ++i)
#define per(i, n) for(int i = (n) - 1; i >= 0 ; --i)
#define forn(i, l, r) for(int i = (l), _end_ = (r); i <= _end_; ++i)
#define nrof(i, r, l) for(int i = (r), _end_ = (l); i >= _end_; --i)
#define FOR(a, b) for(auto (a): (b))
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define X first
#define Y second
#define eps 1e-6
#define pi 3.1415926535897932384626433832795
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(), x.end()

using namespace std;

typedef long long LL;
typedef double flt;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef pair<int,int> pii;
typedef pair<int,LL> pil;
typedef pair<LL,int> pli;
typedef pair<LL,LL> pll;
typedef vector<pil> vil;
typedef vector<pii> vii;
typedef vector<pli> vli;
typedef vector<pll> vll;

const int iinf = 1e9 + 7;
const int oo = 0x3f3f3f3f;
const LL linf = 1ll << 60;
const flt dinf = 1e60;

template <typename T> inline void scf(T &x) {
	bool f = 0;
	x = 0;
	char c = getchar();
	while(c != '-' && (c < '0' || c > '9')) c = getchar();
	if(c == '-') f = 1, c = getchar();
	while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
	if(f) x = -x;
	return;
}

template <typename T1, typename T2> void scf(T1 &x, T2 &y) {
	scf(x);
	return scf(y);
}

template <typename T1, typename T2, typename T3> void scf(T1 &x, T2 &y, T3 &z) {
	scf(x);
	scf(y);
	return scf(z);
}

template <typename T1, typename T2, typename T3, typename T4> void scf(T1 &x, T2 &y, T3 &z, T4 &w) {
	scf(x);
	scf(y);
	scf(z);
	return scf(w);
}

inline char mygetchar() {
	char c = getchar();
	while(c == ' ' || c == '\n') c = getchar();
	return c;
}

template <typename T> inline bool chkmax(T &x, const T &y) {
	return y > x ? x = y, 1 : 0;
}

template <typename T> inline bool chkmin(T &x, const T &y) {
	return y < x ? x = y, 1 : 0;
}

#ifdef King_George
#define DEBUG
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif

//---------------------------------------------------------head----------------------------------------------------

const int maxn = 3e5 + 100;

const int mod = 998244353;

int n, m, ans;
char A[maxn], B[maxn], C[maxn], D[maxn];
int fac[maxn], ifac[maxn];
int f[maxn], g[maxn], has[maxn], pw[maxn], cnt[maxn], ipw[maxn];

int Exp(int x, int n) {
	int y = 1;
	while(n) {
		if(n & 1) {
			y = 1ll * y * x % mod;
		}
		x = 1ll * x * x % mod;
		n >>= 1;
	}
	return y;
}

void pre() {
	fac[0] = 1;
	pw[0] = ipw[0] = 1;
	for (int i = 1; i < maxn; ++i) {
		fac[i] = 1ll * fac[i - 1] * i % mod;
		pw[i] = (pw[i - 1] << 1) % mod;
		ipw[i] = Exp(pw[i], mod - 2);
	}
	ifac[maxn - 1] = Exp(fac[maxn - 1], mod - 2);
	for (int i = maxn - 1; i >= 1; --i) {
		ifac[i - 1] = 1ll * ifac[i] * i % mod;
	}
	return;
}

int CC(int n, int m) {
	return (m < 0 || n < m) ? 0 : 1ll * fac[n] * ifac[n - m] % mod * ifac[m] % mod;
}

void solve(int n, int m, char *A, char *B, char *C, char *D) {
	int x = 0, a = 0, b = 0;
	forn(i, 1, m) {
		x += (C[i] == '1');
	}
	cnt[0] = 0;
	forn(i, 1, n) {
		cnt[i] = cnt[i - 1] + (A[i] == '1' && B[i] == '1');
	}
	cnt[n + 1] = cnt[n];
	if(x) {
		forn(i, 1, n) {
			if(A[i] == '1' || B[i] == '1') {
				f[i] = CC(x + a + b - 1, a + b);
			}
			else {
				f[i] = 0;
			}
			f[i] = 1ll * f[i] * ipw[cnt[i - 1]] % mod;
			if(A[i] == '1') {
				++a;
			}
			if(B[i] == '1') {
				++b;
			}
		}
	}
	else {
		forn(i, 1, n) {
			if(A[i] == '1' || B[i] == '1') {
				f[i] = 1;
				while(++i <= n) {
					f[i] = 0;
				}
				break;
			}
			else {
				f[i] = 0;
			}
		}
	}
	x = 0;
	a = 0;
	b = 0;
	forn(i, 1, m) {
		x += (D[i] == '1');
	}
	if(x) {
		g[n + 1] = 0;
		nrof(i, n, 1) {
			if(A[i] == '1' || B[i] == '1') {
				g[i] = CC(x + a + b - 1, a + b);
			}
			else {
				g[i] = 0;
			}
			g[i] = 1ll * g[i] * pw[cnt[i]] % mod;
			(g[i] += g[i + 1]) %= mod;
			ans = (1ll * g[i] * f[i] + ans) % mod;
			if(A[i] == '1') {
				++a;
			}
			if(B[i] == '1') {
				++b;
			}
		}
	}
	else {
		nrof(i, n, 1) {
			if(A[i] == '1' || B[i] == '1') {
				g[i] = pw[cnt[i]];
				while(i) {
					ans = (1ll * g[i] * f[i] + ans) % mod;
					g[--i] = g[i + 1];
				}
				break;
			}
		}
	}
	return;
}

int main() {
	pre();
	scf(n, m);
	scanf("%s", A + 1);
	scanf("%s", B + 1);
	scanf("%s", C + 1);
	scanf("%s", D + 1);
	solve(n, m, A, B, C, D);
	solve(m, n, C, D, A, B);
	if(!ans) {
		ans = 1;
	}
	printf("%d\n", (ans % mod + mod) % mod);
	return 0;
}

Measured memory_bytes: 10112