#include <bits/stdc++.h>
using namespace std;
int main() {
  int N, K;
  cin >> N >> K;
  vector<long long> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  const long long mod1 = 998, mod2 = 998244353;
  int ans = 0;
  for (int i = 0; i < (1 << N); i++) {
    if (__builtin_popcount(i) != K) {
      continue;
    }
    long long sum1 = 0, sum2 = 0;
    for (int j = 0; j < N; j++) {
      if (i & (1 << j)) {
        sum1 += A[j];
        sum2 += A[j];
        sum1 %= mod1;
        sum2 %= mod2;
      }
    }
    if (sum2 <= sum1) {
      ans++;
    }
  }
  ans %= 998;
  cout << ans << endl;
  return 0;
}