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

typedef modint998244353 mint;
typedef long long ll;

int main(){
	int h,w;cin>>h>>w;
	vector<vector<int>> a(h, vector<int>(w));
	vector<ll> v(0);
	for (int i=0; i<h; i++){
		for (int j=0; j<w; j++){
			cin >> a[i][j];
			v.push_back(((ll)a[i][j] << (ll)30) + (i<<15) + j);
		}
	}
	sort(v.begin(), v.end());
	reverse(v.begin(), v.end());
	ll mask = (1<<15) - 1;
	vector<int> x(h);
	dsu uf(w);
	int cnt = w;
	int cnth = h;
	vector<set<int>> hr(h);
	mint ans = 0;
	for (ll ty: v){
		int j = ty & mask;
		int i = (ty>>15) & mask;
		mint val = ty >> 30;
		int tv = cnt + cnth - 2;
		int mode = 1;
		auto g = hr[i].lower_bound(j);
		if (g != hr[i].end()){
			int k = *g;
			if (uf.same(k,j)) mode = 0;
		}
		if (g != hr[i].begin()){
			g--;
			int k = *g;
			if (uf.same(k,j)) mode = 0;
		}
		if (mode == 1){
			ans += mint(2).pow(tv) * val;
		}
		if (x[i] == 0){
			x[i] = 1;
			cnth -= 1;
		}
		g = hr[i].lower_bound(j);
		if (g != hr[i].end()){
			int k = *g;
			if (!uf.same(k,j)){
				uf.merge(k,j);
				cnt-=1;
			}
		}
		if (g != hr[i].begin()){
			g--;
			int k = *g;
			if (!uf.same(k,j)){
				uf.merge(k,j);
				cnt-=1;
			}
		}
		hr[i].insert(j);
	}
	cout << ans.val() <<endl;
}