#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll MAX = 1000000000000000000LL;
const ll md = 998244353;
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(NULL)

ll pw(ll a, ll n)
{
	ll result = 1;
	while (n)
	{
		if (n&1) result = (result*a)%md;
		a = (a*a)%md;
		n >>= 1;
	}
	return result;
}

vector<int> primes;
void sieve(int n)
{
	bool *isp = new bool[n+1];
	for(int i=0; i<=n; ++i)
		isp[i] = i>1;
	for(int i=2; i*i <= n; ++i)
	{
		if (isp[i])
		{
			for(int j=i*i; j<=n; j+=i)
			{
				isp[j] = false;
			}
		}
	}
	for(int i=0; i<=n; ++i)
	{
		if (isp[i])
		{
			primes.push_back(i);
		}
	}

}

inline ll ad(ll a, ll b, ll mod = md) {
    return (a%mod + b%mod + mod)%mod;
}

inline ll ml(ll a, ll b, ll mod = md) {
    return ((a%mod) * (b%mod))%mod;
}

vl fac(2,1), ifac(2,1);
ll C(ll n, ll r, ll mod = md) {
	if(n < r) return 0;
    return ml(fac[n], ml(ifac[r], ifac[n-r], mod), mod);
}

void cachefact(ll lim, ll mod = md) {
    for(int i = 2; i <= lim; i++) {
        ifac.push_back((ifac[mod%i] * (mod - mod/i) % mod)%mod);
    }
    for(ll i = 2; i <= lim; i++) {
        fac.push_back((fac[i-1] * i)%mod);
        ifac[i] = (ifac[i-1] * ifac[i])%mod;
    }
}

int main()
{
	FAST_IO;

	int n, m;
	cin >> n >> m;
	cachefact(m+n);
	sieve(sqrt(m)+2);
	ll result = 0;
	int ps = primes.size();
	for (int i=1; i<=m; ++i)
	{
		ll I = i, run = 1;
		for(int j=0; j < ps && primes[j]*primes[j] <= I; ++j)
		{
			int e=0;
			while (I%primes[j] == 0)
			{
				I /= primes[j];
				e++;
			}
			run = ml(run, C(n+e-1, e));
		}
		if (I > 1) run = ml(run, n);
		result = ad(result, run);
	}

	cout << result << "\n";
	return 0;
}
// Problem: D - Powers
// Contest: AtCoder - AtCoder Regular Contest 106
// URL: https://atcoder.jp/contests/arc106/tasks/arc106_d
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)	

const int N = 2e5+7,M = 305,MOD = 998244353;
ll fx[M],fc[M],fsa[M],fsb[M];
int a[N],b[N];
ll fa[N][M],fb[N][M];
ll qmul(ll a, ll b, ll P) 
{
  	ll L = a * (b >> 25LL) % P * (1LL << 25) % P;
  	ll R = a * (b & ((1LL << 25) - 1)) % P;
  	return (L + R) % P;
}
ll qpow(ll a,ll b,ll p)
{
	ll res = 1 % p;
	while(b)
	{
		if(b & 1)	res = qmul(res,a,p);
		a = qmul(a,a,p);
		b >>= 1;
	}
	return res;
}
ll C[M][M];
int main()
{
	int n,k,rev2 = qpow(2,MOD - 2,MOD);scanf("%d%d",&n,&k);
    forn(i,1,n)	scanf("%d",&a[i]),b[i] = 2 * a[i];
	C[0][0] = 1;
    forn(i,1,k)	forn(j,0,i)	C[i][j] = (!j) ? 1 : (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
	fsa[0] = n,fsb[0] = n;
	forn(i,1,n)
	{
		ll _a = 1,_b = 1;	
		forn(j,1,k)
		{
			_a = _a * a[i] % MOD,_b = _b * b[i] % MOD;
			fsa[j] = (fsa[j] + _a) % MOD,fsb[j] = (fsb[j] + _b) % MOD;
		}
	}
    
    forn(x,1,k)
    {
		ll lf = 0;
		forn(i,0,k)
		{
			ll t = fsa[i] * fsa[x - i] % MOD;
			t = t * C[x][i] % MOD;
			lf = (lf + t) % MOD;
		}
		// cout << lf << endl;
		lf = ((lf - fsb[x]) % MOD + MOD) % MOD;
		printf("%lld\n",rev2 * lf % MOD);
    }
    return 0;
}
