#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)


int main(){

    int n, k; cin >> n >> k;
    vll a(n); rep(i, n)cin >> a[i];
    vi c(n, 0);
    rep(i, k)c[n-1-i] = 1;
    int cnt = 0;
    do{
        ll s = 0;
        rep(i, n){
            if(c[i] == 1)s += a[i];
        }if((s%998244353) <= (s%998))cnt++;
    }while(next_permutation(all(c)));
    cout << (cnt%998) << endl;
    return 0;
}