#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define MULT_TEST 0
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const int inv2 = (MOD + 1) / 2;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void Add(int &x, int y) {
    x += y;
    if (x >= MOD) x -= MOD;
}
inline void Del(int &x, int y) {
    x -= y;
    if (x < 0) x += MOD;
}
inline int Pow(int a, int b) {
    int ans = 1;
    if (a >= MOD) a %= MOD;
    for (; b; b >>= 1) {
        if (b & 1) ans = ans * a % MOD;
        a = a * a % MOD;
    }
    return ans;
}
template<class T>
struct BIT {
    const int n;
    vector<T> s;
    BIT(int n) : n(n), s(n + 5) {}
    inline void Modify(int x, T v) {
        if (x <= 0) return ;
        for (; x <= n; x += x & (-x)) s[x] += v;
    }
    inline T Query(int x) {
        T ans = 0;
        for (; x; x -= x & (-x)) ans += s[x];
        return ans;
    }
};
inline void Solve() {
    int n, m, ans = 0;
    n = read(), m = read();
    int tot = m * (m - 1) / 2;
    vector<int> p(n), q(n), pom(2 * n);
    vector<vector<int>> v(n, vector<int>(m, 0));
    for (int i = 0; i < n; i++) p[i] = read();
    for (int i = 0; i < n; i++) q[p[i]] = i;
    for (int i = 0; i < n; i++) 
        for (int j = 0; j < m; j++) 
            v[i][j] = read();
    pom[0] = 1;
    for (int i = 1; i < 2 * n; i++) pom[i] = pom[i - 1] * m % MOD;
    BIT<int> T(m + 3);
    for (int i = n - 1; i >= 0; i--) {
        int id = q[i], sum = 0, res = 0;
        int t = id - T.Query(id);
        BIT<int> A(m + 3);
        for (int j = 0; j < m; j++) {
            Add(sum, A.Query(m - v[id][j] + 1));
            A.Modify(m - v[id][j] + 1, 1);
        }
        Add(res, tot % MOD * pom[n - 1 + i]);
        int _s = ((2 * sum - tot) % MOD + MOD) % MOD;
        Add(res, _s * pom[n - 1 + t] % MOD);
        Add(ans, res * inv2 % MOD);
        T.Modify(id + 1, 1);
    }
    printf("%lld\n", ans);
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}
/*
3 2
2 0 1
1 0
1 0
0 1
*/