#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
//const int MOD = (int) 1e9 + 7;
const int MOD = 119 << 23 | 1;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int) 1e9 + 23111992;
const ll LINF = (ll) 1e18 + 23111992;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ull isqrt(ull k) {ull r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() {return abs((int) mt());}
inline int mrand(int k) {return abs((int) mt()) % k;}
#define db(x) cerr << "[" << #x << ": " << (x) << "] ";
#define endln cerr << "\n";

template<class num_t> struct SegmentTree {
    int n;
    vector<num_t> st;
    vector<num_t> st2;
    vector<num_t> lz;
    vector<num_t> lz2;
    void init(int n_) {
        n = n_;
        st.resize(n << 2);
        st2.resize(n << 2);
        lz.resize(n << 2, 1);
        lz2.resize(n << 2);
    }
    void pushdown(int p, int L, int R) {
        if (lz[p] != 1) {
            st[p] = mult(st[p], lz[p]);
            st2[p] = mult(st2[p], lz[p]);
            if (L < R) {
                FOR(i, p << 1, p + 1 << 1) {
                    lz[i] = mult(lz[i], lz[p]);
                }
            }
            lz[p] = 1;
        }
        if (lz2[p]) {
            addmod(st[p], mult(st2[p], lz2[p]));
            if (L < R) {
                FOR(i, p << 1, p + 1 << 1) {
                    addmod(lz2[i], lz2[p]);
                }
            }
            lz2[p] = 0;
        }
    }
    void upd(int p, int i, int L, int R) {
        pushdown(p, L, R);
        if (i < L || R < i) return;
        if (L == R) {
            st2[p] = 1;
            return;
        }
        upd(p << 1, i, L, L + R >> 1);
        upd(p << 1 | 1, i, (L + R >> 1) + 1, R);
        st[p] = (st[p << 1] + st[p << 1 | 1]) % MOD;
        st2[p] = (st2[p << 1] + st2[p << 1 | 1]) % MOD;
    }
    void upd(int p, int l, int r, int L, int R, num_t val) {
        pushdown(p, L, R);
        if (r < L || R < l) return;
        if (l <= L && R <= r) {
            lz[p] = val;
            pushdown(p, L, R);
            return;
        }
        upd(p << 1, l, r, L, L + R >> 1, val);
        upd(p << 1 | 1, l, r, (L + R >> 1) + 1, R, val);
        st[p] = (st[p << 1] + st[p << 1 | 1]) % MOD;
        st2[p] = (st2[p << 1] + st2[p << 1 | 1]) % MOD;
    }
    void upd2(int p, int l, int r, int L, int R, num_t val) {
        pushdown(p, L, R);
        if (r < L || R < l) return;
        if (l <= L && R <= r) {
            lz2[p] = val;
            pushdown(p, L, R);
            return;
        }
        upd2(p << 1, l, r, L, L + R >> 1, val);
        upd2(p << 1 | 1, l, r, (L + R >> 1) + 1, R, val);
        st[p] = (st[p << 1] + st[p << 1 | 1]) % MOD;
        st2[p] = (st2[p << 1] + st2[p << 1 | 1]) % MOD;
    }
    num_t query(int p, int l, int r, int L, int R) {
        pushdown(p, L, R);
        if (r < L || R < l) return 0;
        if (l <= L && R <= r) return st[p];
        return (query(p << 1, l, r, L, L + R >> 1) + query(p << 1 | 1, l, r, (L + R >> 1) + 1, R)) % MOD;
    }
    void upd(int i) {
        upd(1, i, 0, n - 1);
    }
    void upd(int l, int r, num_t val) {
        upd(1, l, r, 0, n - 1, val);
    }
    void upd2(int l, int r, num_t val) {
        upd2(1, l, r, 0, n - 1, val);
    }
    num_t query(int l, int r) {
        return query(1, l, r, 0, n - 1);
    }
};
SegmentTree<int> seg;

void chemthan() {
    int n, k; cin >> n >> k;
    vi fen(n + 1);
    auto upd = [&] (int p, int v) {
        p++;
        for (; p < sz(fen); p += p & -p) {
            fen[p] += v;
        }
    };
    auto query = [&] (int p) {
        p++;
        int res = 0;
        for (; 0 < p; p -= p & -p) {
            res += fen[p];
        }
        return res;
    };
    vi a(n);
    FOR(i, 0, n) cin >> a[i], a[i]--;
    seg.init(n);
    FOR(i, 0, k) {
        seg.upd(a[i]);
    }
    FOR(i, k, n) {
        seg.upd2(a[i] + 1, n - 1, 1);
    }
    FOR(i, k, n) upd(a[i], 1);
    int ik = inv(k);
    int c = mult(k - 1, inv(k));
    int res = mult((long long) k * (k - 1) / 2 % MOD, inv(2));
    addmod(res, mult(seg.st[1], ik));
    FOR(i, k, n) {
        upd(a[i], -1);
        seg.upd(0, n - 1, c);
        seg.upd2(a[i] + 1, n - 1, MOD - 1);
        seg.upd(a[i]);
        int t = query(a[i] - 1);
        seg.upd2(a[i], a[i], t);
        addmod(res, mult(k - 1, inv(2)));
        addmod(res, mult(seg.st[1], ik));
    }
    cout << res << "\n";
}

int32_t main(int32_t argc, char* argv[]) {
    ios_base::sync_with_stdio(0), cin.tie(0);
    if (argc > 1) {
        assert(freopen(argv[1], "r", stdin));
    }
    if (argc > 2) {
        assert(freopen(argv[2], "wb", stdout));
    }
    chemthan();
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}


Measured memory_bytes: 17488