#include <bits/stdc++.h>
// tiom4eg's precompiler options
// POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
// IO settings
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0)
// Quick types
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair <int, int>
#define vi vector <int>
#define mi vector <vector <int>>
// Quick functions
#define endl '\n'
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a.size())
#define pb push_back
#define mp make_pair
// Quick fors
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORS(i, a, b, c) for (int i = a; i < b; i += c)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)
#define EACH(e, a) for (auto& e : a)
// Pragmas
#ifndef TIOM4EG
#pragma GCC optimize("O3,unroll-loops") // let the chaos begin!
#pragma GCC target("avx,avx2,popcnt,tune=native")
#pragma GCC comment(linker, "/stack:200000000")
#endif
// PBDS
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
// POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
using namespace std;
mt19937 rng(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
#define int long long
constexpr int INF = 0x3f3f3f3f, MD = 998244353, MAX = 1000030, LG = 19, MOD = 1e9 + 7, B = 40, P = 31, R = 1 << LG;
const ll INFLL = 1e18 + 7, MOD2 = MOD * MOD;

int f[MAX], rf[MAX];

int bpow(int x, int e) {
    int c = x, r = 1;
    while (e) {
        if (e & 1) r = r * c % MD;
        e >>= 1, c = c * c % MD;
    }
    return r;
}
int inv(int x) { return bpow(x, MD - 2); }
int binom(int k, int n) {
    if (k > n) return 0;
    return f[n] * (rf[k] * rf[n - k] % MD) % MD;
}

signed main() {
    f[0] = 1; FOR(i, 1, MAX) f[i] = f[i - 1] * i % MD;
    rf[MAX - 1] = inv(f[MAX - 1]);
    RFOR(i, MAX - 1, 1) rf[i - 1] = rf[i] * i % MD;
    fastIO;
    int n, k, v, c = 0; cin >> n >> k, v = n + 5;
    int a[n]; FOR(i, 0, n) cin >> a[i];
    RFOR(i, n - 1, 0) if (a[i] < v) v = a[i], ++c;
    v = binom(k, c);
    cout << (MD + v * (k & 1 ? -1 : 1)) % MD;
}