#include <bits/stdc++.h>
#include <atcoder/all>
using ll = long long;
#define MOD 1000000007
#define Mod 998244353
const int MAX = 1000000005;
const long long INF = 1000000000000000005LL;
using namespace std;
using namespace atcoder;

int N, K, ans = 0;
void dfs(vector<int> &X, vector<int> &A) {
    if (X.size() == K) {
        ll S = 0;
        for (int i = 0; i < K; i++) S += A[X[i]];
        if (S % Mod <= S % 998) ans++;
        return;
    }
    if (X.size() == 0) {
        for (int i = 0; i < N; i++) {
            X.push_back(i);
            dfs(X, A);
            X.pop_back();
        }
    } else {
        for (int i = X[X.size() - 1]+1; i < N; i++) {
            X.push_back(i);
            dfs(X, A);
            X.pop_back();
        }
    }
}

int main() {
    ios::sync_with_stdio(0);cin.tie();
    cin >> N >> K;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];
    vector<int> X;
    dfs(X, A);
    cout << ans % 998 << endl;
}