#include #include using namespace atcoder; using namespace std; using mint = modint998244353; using ll = long long; using lb = long double; using VI = vector; using VL = vector; using P = pair; inline void scan(){} template inline void scan(Head&head,Tail&... tail){std::cin>>head;scan(tail...);} #define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__) #define LB(...) lb __VA_ARGS__;scan(__VA_ARGS__) #define INT(...) int __VA_ARGS__;scan(__VA_ARGS__) #define STR(...) string __VA_ARGS__;scan(__VA_ARGS__) template inline bool chmax(ll& a, ll b) { if (a < b) { a = b; return 1; } return 0; }template inline bool chmin(ll& a, ll b) { if (a > b) { a = b; return 1; } return 0; } template std::istream &operator>>(std::istream&is,std::vector&v){for(T &in:v){is>>in;}return is;} template std::ostream &operator<<(std::ostream&os,const std::vector&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;} #define rep(i, s, n) for (int i = (s); i < (int)(n); i++) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(),(a).rend() const int inf = INT_MAX / 2; const ll infl = 1LL << 60; //_ int n, k; vector a; vector x; int ans = 0; void dfs(int v){ x.push_back(v); if(x.size() == k){ ll s1 = 0; mint s2 = 0; for(auto&& i : x){ s1 += a[i]; s2 += a[i]; s1 %= 998; } if(s2.val() <= s1){ ans++; } }else{ rep(i, v + 1, n){ dfs(i); x.pop_back(); } } } int main(){ cin >> n >> k; a.resize(n); cin >> a; rep(i, 0, n){ dfs(i); //cout << x << endl; x.pop_back(); } cout << ans % 998 << endl; }