#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define ld long double
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
using Graph = vector<vector<int>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

int main(){
  // input
  int N,K; cin >> N >> K;
  vector<ll> A(N);
  for(int i = 0; i < N; i++) cin >> A[i];
  
  // solve
  ll ans = 0;
  
  stack<vector<int>> st;
  st.push({0,-1,0,0}); // v = {bit,cur,mod998, mod998244353}
  
  while(!st.empty()){
    int bit = st.top()[0], cur = st.top()[1], mod998 = st.top()[2], mod353 = st.top()[3];
    st.pop();
    if(__builtin_popcount(bit) == K){
      if(mod353 <= mod998) ans++;
    }
    else for(int nxt = cur + 1; nxt < N; nxt++){
      st.push({bit+(1<<nxt),nxt,(mod998+A[nxt])%998,(mod353+A[nxt])%mod});
    }
  }
  
  // output
  cout << ans % 998 << endl;
}