#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int h, w; cin >> h >> w;
	vector<vector<int>>a(h, vector<int>(w));
	dsu uf(h + w);
	vector<pair<int, P>>v;
	rep(i, h)rep(j, w) {
		int a; cin >> a;
		v.push_back({ a,{i,j} });
	}
	sort(allR(v));
	mint ans = 0;
	int x = h + w - 1;
	for (auto e : v) {
		int i = e.second.first;
		int j = e.second.second;
		if (uf.same(i, j + h))continue;
		uf.merge(i, j + h);
		x--;
		mint v = e.first;
		v *= mint(2).pow(x);
		ans += v;
	}
	cout << ans.val() << endl;
	return 0;
}