#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
typedef long long ll;
typedef unsigned long long ull;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int MAX = 1e9;
const int MIN = -1*1e9;
const ll MAXLL = 1e18;
const ll MINLL = -1*1e18;
const ll MOD = 998244353;
//const ll MOD = 1000000007;
ll N,K,Ans=0;
vector<ll> V(30);

void dfs(int Step, int I, ll Count)
{
    if(Step > K || N-I < K-Step) return;
    if(I == N)
    {
        if(Step == K)
        {
            if(Count%998 >= Count%MOD) Ans++;
        }
        return;
    }
    dfs(Step+1,I+1,Count+V[I]);
    dfs(Step,I+1,Count);
}
int main()
{
    cin >> N >> K;
    for(int i = 0; i < N; i++)
    {
        cin >> V[i];
    }
    dfs(0,0,0);
    cout << Ans%998 << endl;
    return 0;
}