#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
#include <vector>
#include <atcoder/all>
// Π(1+A_i x)のFFT
std::vector<mint> divideConquerFFT(const std::vector<int> &a, int l, int r) {
if (r == l)return { 1 };
if (r - l == 1) return { 1, a[l] };
int m = (l + r) / 2;
return atcoder::convolution(divideConquerFFT(a, l, m), divideConquerFFT(a, m, r));
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, k; cin >> n >> k;
vector<int>a(n);
rep(i, n)cin >> a[i];
auto ans = divideConquerFFT(a, 0, n);
ans.resize(k + 1);
cout << ans[k].val() << endl;
return 0;
}