#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
void solve()
{
	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[N-i-1] = 1;
	int ans = 0;
	do
	{
		long long S = 0;
		for(int i = 0;i < N;i++) if(P[i]) S += A[i];
		if(S%998244353 <= S%998) ans++;
	} while(next_permutation(P.begin(),P.end()));
	ans %= 998;
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}