#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
typedef long long ll;

void solve() {
    ll n , k;
    cin >> n >> k;
    vector<ll> A(n);
    for (ll i = 0; i < n; ++i) cin >> A[i];

    vector<ll> SE(n,0);
    for (ll i = 0; i < k; ++i) SE[i] = 1;
    sort(SE.begin(), SE.end());
    static_modint<998> ans = 0;
    do {
        modint998244353 tmpa = 0;
        static_modint<998> tmpb = 0;
        for (ll i = 0; i < n; ++i) {
            if (SE[i]==1) tmpa += A[i],tmpb += A[i];
        }

        if (tmpa.val() <= tmpb.val()) ++ans;

    } while (next_permutation(SE.begin(), SE.end()));

    cout << ans.val() << endl;

    
}

int main() {
    solve();
    return 0;
}