#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


ll n,k;
ll a[30];
ll ans;
void dfs(int ni,ll aa,ll b,int cnt){
    if(ni==n) return;
    dfs(ni+1,aa,b,cnt);
    aa += a[ni];
    b += a[ni];
    aa %= 998244353;
    b %= 998;
    cnt++;
    if(cnt==k){
        if(b>=aa) ans++;
        return;
    }
    dfs(ni+1,aa,b,cnt);
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin>>n>>k;
    for(int i = 0;i<n;i++) cin>>a[i];
    dfs(0,0,0,0);
    cout<<ans%998<<endl;
}