#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define debug 0
#define YES cout << "Yes" << endl;
#define NO cout << "No" << endl;
using ll = long long;
using ld = long double;
const int mod = 998244353;
const int MOD = 1000000007;
const double pi = atan2(0, -1);
#include <time.h>
#include <chrono>

int main() {
	int N, K;
	cin >> N >> K;
	vector<ll> A(N);
	rep(i, N) {
		cin >> A[i];
	}

	ll ans = 0;
	vector<int> v(N, 0);
	rep(i, K) {
		v[N - 1 - i] = 1;
	}
	do {
		ll s = 0;
		rep(i, N) {
			if (v[i]) {
				s += A[i];
			}
		}
		if (s % 998 >= s % mod) {
			ans++;
		}
	} while (next_permutation(v.begin(), v.end()));

	cout << ans % 998 << endl;
}