/* -*- coding: utf-8 -*-
 *
 * 2561.cc:  No.2561 みんな大好きmod 998 - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 28;
const int MAX_M = 10;
const int MBITS = 1 << MAX_M;
const int MMSK = MBITS - 1;
const int MOD0 = 998;
const int MOD1 = 998244353;

/* typedef */

typedef long long ll;

/* global variables */

int bnums[MBITS], as[MAX_N];

/* subroutines */

inline int bitnum(int bits) {
  return
    bnums[bits & MMSK] +
    bnums[(bits >> MAX_M) & MMSK] +
    bnums[(bits >> (MAX_M * 2)) & MMSK];
}

/* main */

int main() {
  for (int bits = 1, msb = 1; bits < MBITS; bits++) {
    if ((msb << 1) <= bits) msb <<= 1;
    bnums[bits] = bnums[bits ^ msb] + 1;
  }

  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  int nbits = 1 << n, cnt = 0;
  for (int bits = 0; bits < nbits; bits++)
    if (bitnum(bits) == k) {
      ll s = 0;
      for (int i = 0, bi = 1; i < n; i++, bi <<= 1)
	if (bits & bi) s += as[i];
      int s0 = s % MOD0, s1 = s % MOD1;
      if (s1 <= s0) cnt++;
    }

  printf("%d\n", cnt % MOD0);
  return 0;
}