#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, l, r) for(ll i = l; i < r; ++i)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, auto b) {return a > b ? a = b, 1 : 0;}
bool chmax(auto &a, auto b) {return a < b ? a = b, 1 : 0;}

struct IOSetup {
  IOSetup() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template<class T>
void print(vector<T> a) {
  for(auto x : a) cout << x << ' ';
  cout << endl;
}

void print(auto x) {cout << x << endl;}

template<class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}


ll cost(ll xi,ll yi,ll xj, ll yj,ll xk,ll yk){
  // i -> j -> k -> i
  ll x=min(xj,xk);
  ll y=min(yj,yk);
  return ((x-xi)+(y-yi)+(xj-x)+(yj-y)+(xk-x)+(yk-y));
}

ll inf=1LL<<60;
vector<array<ll,2>>xy;

const ll mod=998244353;

ll modpow(ll a,ll n){
  ll r=1;
  while(n>0){
    r*=(a*(n%2));
    r%=mod;
    a=(a*a)%mod;
    n/=2;
  }
  return r;
}

vector<int> inv(vector<int> Q){
  int n=Q.size();
  vector<int> R(n);
  for(int i=0;i<n;i++)R[Q[i]]=i;
  return R;
}


struct BIT {
  ll n;
  vector<ll> data;

  BIT() = default;
  BIT(ll n) : n(n), data(n+1, 0) {}

  void add(ll x, ll val) {
    x++;
    for(; x <= n; x += x & -x) data[x] += val;
    return;
  }

  ll sum(ll x) {
    ll ret = 0;
    for(; x > 0; x -= x & -x) ret += data[x];
    return ret;
  }

  ll sum(ll lx, ll rx) {return sum(rx) - sum(lx);}
};


ll te(vector<int> Q){
  int n=Q.size();
  BIT B(n);
  ll res=0;
  for(int i=n-1;i>=0;i--){
    res+=B.sum(Q[i]);
    B.add(Q[i],1);
  }
  return res%mod;
}

int main(){
    int L,B;
    cin>>L>>B;
    vector<int> P(L);
    for(int i=0;i<L;i++)cin>>P[i];
    vector<int> IP=inv(P);

    vector<vector<int>> V(L,vector<int>(B));
    for(int i=0;i<L;i++){
      for(int j=0;j<B;j++){
        cin>>V[i][j];
      }
    }

    vector<ll> POW(2*L+1,1);
    for(int i=0;i<2*L;i++)POW[i+1]=(POW[i]*B)%mod;
    
    ll an=0;
    BIT BT(L);
    for(int i=0;i<L;i++)BT.add(i,1);
    
    for(int i=L-1;i>=0;i--){
      ll res=0;
      ll id=IP[i];
      ll t=te(V[id]);
      ll len=POW[BT.sum(0,id)];

      ll BL=POW[BT.sum(id+1,L)];

      res+=t*BL%mod;

      res+=((BL*(BL-1)/2)%mod)*((B*(B-1)/2)%mod)%mod;
      res%=mod;
      res*=(len*len%mod);
      res%=mod;
      res*=POW[L-1-i];
      res%=mod;
      an+=res;
      an%=mod;
      // cerr<<i<<" "<<res<<" "<<BL<<" "<<len<<endl;
      BT.add(id,-1);
    }
    cout<<an<<endl;
}