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

using i64 = long long;
const int P = 998244353;

int ask(vector<int> &tr, int p) {
    int ret = 0;
    while(p < tr.size()) {
        ret += tr[p];
        p += ((p + 1) & (-p - 1));
    }
    return ret;
}

void add(vector<int> &tr, int p) {
    while(p >= 0) {
        tr[p] ++;
        p -= ((p + 1) & (-p - 1));
    }
}

int calc(vector<int> &a) {
    vector<int> tr(a.size());
    int ret = 0;
    for(int x : a) {
        ret += ask(tr, x);
        add(tr, x);
    }
    return ret;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int L, B;
    cin >> L >> B;
    
    vector<int> bpow(L + 1);
    bpow[0] = 1;
    for(int i = 1; i <= L; i ++)
        bpow[i] = bpow[i - 1] * (i64)B % P;
    
    vector<int> p(L);
    for(int i = 0; i < L; i ++) cin >> p[i];

    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];
    
    int ans = 0;
    vector<int> tr(L);
    for(int i = 0; i < L; i ++) {
        int x = ask(tr, p[i]) + L - i - 1, y = L - 1 - x;
        int z = L - p[i] - 1, q = p[i] + 1;
        //cout << i << ": " << z << " " << q << " | " << (bpow[x] * (i64)bpow[y] % P * (i64)bpow[y]) << " " << calc(v[i]) << " " << (((bpow[q] * ((i64)bpow[q] - bpow[q - 1]) / 2) % P * bpow[z]) % P + P - (bpow[x] * (i64)bpow[y] % P * (i64)bpow[y] % P * (B * (B - 1ll) / 2 % P)) % P) * ((P + 1ll) / 2) % P << "\n";
        ans = (ans + (bpow[x] * (i64)bpow[y] % P * (i64)bpow[y]) % P * calc(v[i])) % P;
        ans = (ans + (((bpow[q] * ((i64)P + bpow[q] - bpow[q - 1]) % P * ((P + 1ll) / 2)) % P * bpow[z]) % P + P - (bpow[x] * (i64)bpow[y] % P * (i64)bpow[y] % P * (B * (B - 1ll) / 2 % P)) % P) * ((P + 1ll) / 2) % P) % P;
        add(tr, p[i]);
    }
    cout << ans << "\n";
}

/*
 3 2
 2 0 1
 1 0
 1 0
 0 1
*/