#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const double PI = 3.141592653589793;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll mod = 998244353;
  ll H, W;
  cin >> H >> W;
  vector<ll> power(H + W + 1, 1);
  for (ll i = 0; i < H + W; ++i) {
    power.at(i + 1) = power.at(i) * 2 % mod;
  }
  vector<vector<ll>> A(H, vector<ll>(W));
  vector<vector<ll>> num;
  for (ll i = 0; i < H; ++i) {
    for (ll j = 0; j < W; ++j) {
      cin >> A.at(i).at(j);
      num.push_back({A.at(i).at(j), i, j});
    }
  }
  sort(rrng(num));
  ll r_num = W, c_num = H;
  vector<bool> row(W, false);
  vector<bool> col(H, false);
  ll ans = 0;
  for (ll i = 0; i < num.size(); ++i) {
    vector<ll> n = num.at(i);
    ll h = n.at(1), w = n.at(2);
    if (col.at(h) && row.at(w)) {
      continue;
    }
    if (!col.at(h)) {
      col.at(h) = true;
      c_num -= 1;
    }
    if (!row.at(w)) {
      row.at(w) = true;
      r_num -= 1;
    }
    ans += (n.at(0) * power.at(r_num) % mod) * power.at(c_num) % mod;
    ans %= mod;
  }
  cout << ans << "\n";
}
//0011
//1100
//1100
//0011

//0101
//1010
//1010
//0101