#include<bits/stdc++.h> #define N 200010 #define mod 998244353ll usingnamespace std; using ll = longlong; int n, k; int a[N], s[N]; ll ans; int tot; ll fact[N << 1], nifact[N << 1]; inline ll qp(ll x, ll y){ ll ans = 1; while (y) { if (y & 1) ans = ans * x % mod; y >>= 1; x = x * x % mod; } return ans; } inline ll c(ll x, ll y){ return fact[x] * nifact[y] % mod * nifact[x - y] % mod; } intmain(){ freopen("b.in", "r", stdin); freopen("b.out", "w", stdout); scanf("%d%d", &n, &k); for (int i = 1; i <= n; ++i) { scanf("%d", a + i); ++s[a[i]]; } fact[0] = 1; nifact[0] = 1; for (int i = 1; i <= n + k; ++i) { fact[i] = fact[i - 1] * i % mod; nifact[i] = qp(fact[i], mod - 2); } for (int i = 0; i < k + tot; ++i) { ans += c(k + tot - 1, i); ans %= mod; // cout << ans << endl; if (i < N && s[i]) ++tot; } printf("%lld", ans); return0; }