#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001


int main(){
	
	int h,w;
	cin>>h>>w;
	vector a(h,vector<int>(w));
	vector<pair<int,int>> t;
	rep(i,h){
		rep(j,w){
			cin>>a[i][j];
			t.emplace_back(i,j);
		}
	}
	sort(t.rbegin(),t.rend(),[&](pair<int,int> x,pair<int,int> y){
		return a[x.first][x.second]<a[y.first][y.second];
	});
	int rem = h+w-1;
	mint ans = 0;
	dsu D(h+w);
	rep(i,t.size()){
		int x = t[i].first,y = t[i].second;
		if(D.same(x,h+y))continue;
		D.merge(x,h+y);
		rem--;
		ans += mint(2).pow(rem) * a[x][y];
	}
	cout<<ans.val()<<endl;
	
	return 0;
}