#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
ld pi=3.141592653589793;
const int inf=2e9;
const ll linf=2e18;
const ld eps=1e-14;
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl

template <typename T> bool next_combination(const T first, const T last, ll k) {
    const T subset = first + k;
    // empty container | k = 0 | k == n 
    if (first == last || first == subset || last == subset) {
        return false;
    }
    T src = subset;
    while (first != src) {
        src--;
        if (*src < *(last - 1)) {
            T dest = subset;
            while (*src >= *dest) {
                dest++;
            }
            iter_swap(src, dest);
            rotate(src + 1, dest + 1, last);
            rotate(subset, subset + (last - dest) - 1, last);
            return true;
        }
    }
    // restore
    rotate(first, subset, last);
    return false;
}

int main() {
    ll n,k;
    cin >> n >> k;
    vector<ll> a(n);
    vector<ll> p(n);
    for(int i=0; i<n; i++) {
        p[i]=i;
    }
    for(int i=0; i<n; i++) {
        cin >> a[i];
    }

    ll ans=0;
    do {
        ll s=0;
        for (int i = 0; i < k; i++) {
            s+=a[p[i]];
        }
        if(s%998244353<=s%998) {
            ans++;
        }
    } while(next_combination(p.begin(), p.end(), k));

    cout << ans%998 << endl;
}