#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// S_1 = ((1), (2), ..., (m))
// S_2 = ((1, 1), (1, 2), ..., (m, m))
using mint = modint998244353;
int main() {
  int n, k; cin >> n >> k;
  vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i];
  vector<int> p(n);
  for (int i = 0; i < k; i++) { p[i] = 1; }
  sort(p.begin(), p.end());
  int cnt = 0;
  do {
    long long s1 = 0, s2 = 0;
    for (int i = 0; i < n; i++) {
      if (p[i]) {
        s1 += a[i];
        s2 += a[i];
        s1 %= 998244353;
        s2 %= 998;
      }
    }
    if (s1 <= s2) cnt++;
  } while (next_permutation(p.begin(), p.end()));
  cout << cnt % 998 << endl;

}