#include <bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define y0 sxxxxx
#define pii pair<int, int>
#define ll long long
#define fi first
#define se second
#define bg begin
namespace IO {

cs int RLEN = 1 << 22 | 1;
char ibuf[RLEN], *ib, *ob;
inline char gc() {
    (ib == ob) && (ob = (ib = ibuf) + fread(ibuf, 1, RLEN, stdin));
    return (ib == ob) ? EOF : *ib++;
}
inline int read() {
    char ch = gc();
    int res = 0;
    bool f = 1;
    while (!isdigit(ch)) f ^= ch == '-', ch = gc();
    while (isdigit(ch)) res = (res * 10) + (ch ^ 48), ch = gc();
    return f ? res : -res;
}
inline ll readll() {
    char ch = gc();
    ll res = 0;
    bool f = 1;
    while (!isdigit(ch)) f ^= ch == '-', ch = gc();
    while (isdigit(ch)) res = (res * 10) + (ch ^ 48), ch = gc();
    return f ? res : -res;
}
inline char readchar() {
    char ch = gc();
    while (isspace(ch)) ch = gc();
    return ch;
}
inline int readstring(char *s) {
    int top = 0;
    char ch = gc();
    while (isspace(ch)) ch = gc();
    while (!isspace(ch) && ch != EOF) s[++top] = ch, ch = gc();
    s[top + 1] = '\0';
    return top;
}

}  // namespace IO
using IO::read;
using IO::readchar;
using IO::readll;
using IO::readstring;
template <typename tp>
inline void chemx(tp &a, tp b) { (a < b) ? (a = b) : 0; }
template <typename tp>
inline void chemn(tp &a, tp b) { (a > b) ? (a = b) : 0; }

cs int mod=998244353;
inline int add(int a,int b){return (a+b)>=mod?(a+b-mod):(a+b);}
inline int dec(int a,int b){return (a<b)?(a-b+mod):(a-b);}
inline int mul(int a,int b){static ll r;r=(ll)a*b;return (r>=mod)?(r%mod):r;}
inline void Add(int &a,int b){a=(a+b)>=mod?(a+b-mod):(a+b);}
inline void Dec(int &a,int b){a=(a<b)?(a-b+mod):(a-b);}
inline void Mul(int &a,int b){static ll r;r=(ll)a*b;a=(r>=mod)?(r%mod):r;}
inline int ksm(int a,int b,int res=1){for(;b;b>>=1,Mul(a,a))(b&1)&&(Mul(res,a),1);return res;}
inline int Inv(int x){return ksm(x,mod-2);}
inline int fix(ll x){x%=mod;return (x<0)?x+mod:x;}
cs int N=500005;
int L,B;
vector<int>v[N];
struct bit{
vector<int>tr;
#define lb(x) (x&(-x))
void update(int p){
    for(;p>0;p-=lb(p))tr[p]++;
}
int query(int p,int res=0){
    for(;p<=B;p+=lb(p))res+=tr[p];return res;
}
}t1,t2;
int C(int x){
    return (1ll*x*(x-1)/2)%mod;
}
void solve(){
    L=read(),B=read();
    vector<int>p(L+1);
    for(int i=0;i<L;i++)p[i]=read();
    for(int i=0;i<L;i++){
        v[i].resize(B+1);
        for(int j=0;j<B;j++)v[i][j]=read();
    }
    int ans=0;
    t1.tr.resize(L+1);
    vector<int>id;
    for(int i=0;i<L;i++){
        int xx=i-t1.query(p[i]+1);
        t1.update(p[i]+1);
        int yy=ksm(B,p[i]-xx);
        t2.tr.clear();
        t2.tr.resize(B+1);
        int cnt=0;
        for(int j=0;j<B;j++){
            Add(cnt,t2.query(v[i][j]+1));
            t2.update(v[i][j]+1);
        }
        Mul(cnt,yy);
        Add(cnt,mul(C(yy),C(B)));
        Mul(cnt,ksm(B,xx));
        Mul(cnt,ksm(B,xx));
        Mul(cnt,ksm(B,L-1-p[i]));
        Add(ans,cnt);
    }
    cout<<ans<<'\n';
}

signed main() {
	#ifdef Stargazer
	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	#endif

    int T = 1;
    //int T=1;
    while (T--) solve();
}