// 

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ll = long long;

#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) (x).begin(), (x).end()

const int INF = (int)(1e9);
const int mod1 = 998;
const int mod2 = 998244353;

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> a(n);
	rep(i, n) cin >> a[i];
	vector<bool> ord(n);
	fill(ord.end()-k, ord.end(), true);
	int res = 0;
	do {
		int val1 = 0, val2 = 0;
		rep(i, n) if (ord[i]) {
			val1 = (val1 + a[i]) % mod1;
			val2 = (val2 + a[i]) % mod2;
		}
		if (val1 >= val2) res = (res + 1) % mod1;
	} while (next_permutation(all(ord)));
	cout << res << endl;
	return 0;
}