#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9 + 1001010;
constexpr ll llINF = (ll)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}
const string ELEM_SEPARATION = " ", VEC_SEPARATION = endn;
template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}
template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");} return o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : "");} return o;}
template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}
template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}
template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}
template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}
ll floor(ll a, ll b){if(b < 0) a = -a, b = -b; return a >= 0 ? a/b : (a+1)/b - 1;}
ll ceil (ll a, ll b){if(b < 0) a = -a, b = -b; return a > 0 ? (a-1)/b + 1 : a/b;}
ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}
// ================================== ここまでテンプレ ==================================

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

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, k; cin >> n >> k;
    vector<ll> a(n); cin >> a;

    vector<int> order(n, 0);
    for(int i = 0; i < k; i++){
        order[i] = 1;
    }
    reverse(order.begin(), order.end());

    ll ans = 0;
    do{
        ll sum = 0;
        for(int i = 0; i < n; i++){
            if(order[i] == 1){
                sum += a[i];
            }
        }

        ll sum1 = sum % mod1;
        ll sum2 = sum % mod2;
        if(sum1 >= sum2) ans++;
    }while(next_permutation(order.begin(), order.end()));

    ans %= mod1;
    cout << ans << endl;
    return 0;
}