H,W=map(int,input().split())
A=[list(map(int,input().split())) for i in range(H)]

mod=998244353
POW2=[1]
for i in range(3000):
    POW2.append(POW2[-1]*2%mod)

# UnionFind

Group = [i for i in range(H+W+1)] # グループ分け
Nodes = [1]*(H+W+1) # 各グループのノードの数

def find(x):
    while Group[x] != x:
        x=Group[x]
    return x

def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)

X=[]
for i in range(H):
    for j in range(W):
        X.append((A[i][j],i,j))

X.sort(reverse=True)

ANS=0
now=H+W-2
for a,i,j in X:
    if find(i)==find(j+H):
        continue
    else:
        ANS=(ANS+a*POW2[now])%mod
        now-=1
        Union(i,j+H)

print(ANS)