#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/extc++.h>
using namespace std;
using ld = long double; 
const vector<int> dx = {0, 0, 1, -1};
const vector<int> dy = {1, -1, 0, 0};
#define vec vector
#define int long long
#define double long double
//cout<<setprecision(10)<<fixed<<..
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, x, n) for (int i = x; i < (int)(n); i++)
#define pii pair<int,int>
#define pq priority_queue
#define all(V) begin(V),end(V)
#define printpair(p) cout<<p.first<<" "<<p.second<<"\n"
#define tple tuple<int,int,int>
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
#define mend(a,b) G[a].push_back(b)

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n,k;cin>>n>>k;
    vec<int> A(n);
    int m=998;
    rep(i,n){cin>>A[i];}
    vec<bool> Z(n,false);
    rep(i,k){Z[i]=true;}
    sort(all(Z));
    int ans=0;
    do{
        int cur=0;
        rep(i,n){
            if(Z[i]){
                cur+=A[i];
            }
        }
        if(cur%998>=cur%998244353){
            ans++;
            ans%=998;
        }
    }while(next_permutation(all(Z)));
    cout<<ans<<"\n";

}