#include<bits/stdc++.h>
using namespace std;
using lint = long long;

int ans = 0;
int M1 = 998244353;
int M2 = 998;
int N, K;
vector<int>A(50);

void f(vector<int>&B, int idx) {
    if(B.size() == K) {
    	lint S = 0;
    	for(int i = 0; i < K; i++) {
    		S += B[i];
    	}
        if(S%M1 <= S%M2) ans++;
        return;
    } 
    for(int i = idx; i < N; i++) {
        B.push_back(A[i]);
        f(B, i+1);
        B.pop_back();
    }
}

int main() {
    cin >> N >> K;
    for(int i = 0; i < N; i++) cin >> A[i];
    
    vector<int>B;
    f(B, 0);
    
    cout << ans%M2 << endl;
}