#include "bits/stdc++.h"
using namespace std;
typedef long long ll;

ll mod = 998244353;

int L, B, P[500010], f[500010];
vector<int> V[500010];

ll qpow(ll x, ll k)
{
    ll re = 1;
    while (k)
    {
        if (k & 1) re = re * x % mod;
        k >>= 1;
        x = x * x % mod;
    }
    return re;
}

int minn[500010], tree[500010];

void add(int a[], int x, int k, int up)
{
    while (x <= up)
    {
        a[x] += k;
        x = x + (x & -x);
    }
}

int sum(int a[], int x)
{
    int re = 0;
    while (x)
    {
        re += a[x];
        x -= (x & -x);
    }
    return re;
}


bool cmp(int x, int y)
{
    return P[x] > P[y];
}

int main()
{

    // ios::sync_with_stdio(false);
    // cin.tie(0);

    cin >> L >> B;
    for (int i = 0; i < L; i++)
    {
        cin >> P[i];
    }
    for (int i = 0; i < L; i++)
    {
        for (int j = 0; j < B; j++)
        {
            int c;
            cin >> c;
            V[i].push_back(c);
        }
    }

    for (int i = 0; i < L; i++)
    {
        add(tree, P[i] + 1, 1, L);
        minn[i] = sum(tree, P[i] + 1);
    }

    for (int i = 0; i < L; i++)
    {

        f[i] = i;
    }
    sort(f, f + L, cmp);

    ll ans = 0;

    for (int k = L; k >= 1; k--)
    {
        int j = f[L - k];
        ll inv = 0;
        for (int i = 0; i <= B; i++)
        {
            tree[i] = 0;
        }
        for (int i = 0; i < B; i++)
        {
            //cout<<V[j][i]<<" ";
            add(tree, V[j][i] + 1, 1, B);
            inv += sum(tree, B) - sum(tree, V[j][i] + 1);
        }
        inv %= mod;
        ans += (qpow(B, k - minn[j]) * inv % mod
            + (B - 1) * B / 2 % mod
                * ( (qpow(B, k - minn[j]) - 1)
                * qpow(B, k - minn[j]) / 2 % mod ) ) % mod
            * qpow(B, 2 * (minn[j] - 1)) % mod * qpow(B, L - k) % mod;
        //cout<<(B-1)*B/2%mod * ( (qpow(B,k-minn[j])-1) * qpow(B, k-minn[j])/2%mod) %mod * qpow(B,L-k)%mod<<" ";
        //cout << ans << " ";
        ans %= mod;
    }

    cout << ans;

    return 0;
}

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


 */