#include<bits/stdc++.h>
using namespace std;
using ll=long long;

ll n,k;
ll ans=0;

void dfs(ll now,vector<ll> &a,vector<ll> &used){
  if(used.size()==k){
    ll sum1=0;
    ll sum2=0;
    for(ll i=0;i<k;i++){
      sum1+=a[used[i]];
      sum1%=998244353;
      sum2+=a[used[i]];
      sum2%=998;
    }
    if(sum1<=sum2){
      ans++;
      ans%=998;
    }
    return;
  }
  for(ll i=now+1;i<=n;i++){
    used.push_back(i);
    dfs(i,a,used);
    used.pop_back();
  }
}

int main(){
  cin>>n>>k;
  vector<ll> a(n+1);
  for(ll i=1;i<=n;i++){
    cin>>a[i];
  }
  vector<ll> used;
  dfs(0,a,used);
  cout<<ans<<endl;
}