#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
template <class T = ll>
using vc = vector<T>;
template <class T = ll>
using vvc = vc<vc<T>>;
void solve();
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    ll t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) solve();
    return 0;
}

void solve() {
    ll n, k;
    cin >> n >> k;
    vc<ll> a(n);
    for (auto& x : a) cin >> x;
    ll res = 0;
    auto dfs = [&](auto&& dfs, ll len, vc<ll>& pos) -> void {
        if (len == k) {
            ll s1 = 0, s2 = 0;
            for (auto x : pos) {
                s1 += a[x];
                s1 %= 998;
                s2 += a[x];
                s2 %= 998244353;
            }
            if (s2 <= s1) res++, res %= 998;
            return;
        }
        ll x = 0;
        if (len) x = pos.back() + 1;
        for (ll i = x; i < n; i++) {
            pos.push_back(i);
            dfs(dfs, len + 1, pos);
            pos.pop_back();
        }
    };
    vc<ll> pos;
    dfs(dfs, 0, pos);
    cout << res << endl;
}