#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int H,W; const ll mo=998244353; int A[1010][1010]; ll p2[10101010]; template class UF { public: vector par,rank,cnt,G[um]; UF() {par=rank=vector(um,0); cnt=vector(um,1); for(int i=0;irank[y]) return par[x]=y; rank[x]+=rank[x]==rank[y]; return par[y]=x; } void dump(int num=um) { //グループ分けした配列を作る int i; FOR(i,num) G[i].clear(); FOR(i,num) G[operator[](i)].push_back(i); } }; UF<2020> uf; int num; void solve() { int i,j,k,l,r,x,y; string s; p2[0]=1; FOR(i,1000005) p2[i+1]=p2[i]*2%mo; cin>>H>>W; num=H+W-1; vector> V; FOR(y,H) FOR(x,W) { cin>>A[y][x]; V.push_back({A[y][x],y*1000+x}); } sort(ALL(V)); reverse(ALL(V)); ll ret=0; FORR2(v,t,V) { y=t/1000; x=t%1000; if(uf[y]!=uf[1000+x]) { uf(y,1000+x); num--; ret+=v*p2[num]%mo; } } cout<