#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

const ll mod1 = 998;
const ll mod2 = 998244353;

int main(){
    int N, K;
    cin >> N >> K;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];

    vector<int> per(N, 0);
    rep(i, 0, K){
        per[N-1-i] = 1;
    }

    ll ans = 0LL;
    do{

        ll S = 0LL;
        rep(i, 0, N){
            if(per[i]){
                S += A[i];
            }
        }

        ll S1 = S % mod1, S2 = S % mod2;
        if(S1 >= S2) ans++;
        ans %= mod1;

    }while(next_permutation(all(per)));

    cout << ans << endl;
    return 0;
}