#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

int main(){
	
	int N,K;
	cin>>N>>K;
	vector<int> t(N,1);
	rep(i,N-K)t[i] = 0;
	long long ans = 0;
	vector<long long> a(N);
	rep(i,N)cin>>a[i];
	
	do{
		long long sum = 0;
		rep(i,N){
			if(t[i])sum += a[i];
		}
		if(sum%998244353<=sum%998)ans++;
	}
	while(next_permutation(t.begin(),t.end()));
	cout<<ans%998<<endl;
	return 0;
}