#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
vm inv(const vm&f){
  vm g{1/f[0]};
  while(sz(g)<sz(f)){
    vm x(f.begin(),f.begin()+min(sz(f),2*sz(g)));
    x=convolution(x,convolution(g,g));
    g.resize(2*sz(g));
    for(int i=sz(g)/2;i<min(sz(x),sz(g));i++)g[i]-=x[i];
  }
  return {g.begin(),g.begin()+sz(f)};
}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,M;cin>>N>>M;
  vl V(N);cin>>V;
  
  queue<pair<vm,vm>>Q;
  rep(i,0,N)Q.emplace(make_pair(vm{1},vm{1,-V[i]}));
  while(sz(Q)>1){
  	queue<pair<vm,vm>>_Q;
  	while(sz(Q)>1){
  		auto[p,q]=Q.front();Q.pop();
  		auto[r,s]=Q.front();Q.pop();
  		auto f=convolution(p,s),g=convolution(q,r);
  		rep(i,0,sz(g)){
  			if(i==sz(f))f.emplace_back(g[i]);
  			else f[i]+=g[i];
  		}
  		_Q.emplace(make_pair(f,convolution(q,s)));
  	}
  	if(sz(Q))_Q.emplace(Q.front());
  	Q=_Q;
  }
  auto[p,q]=Q.front();
  q.resize(100010);
  auto F=convolution(p,inv(q));
  
  vb prime(2e6,1);
  rep(i,2,2e6)if(prime[i])for(ll j=2*i;j<sz(prime);j+=i)prime[j]=0;
  vvl D(2e6);
  rep(i,2,2e6)if(prime[i])for(ll j=i;j<sz(prime);j+=i)D[j].emplace_back(i);
  vl T(1e6,1),C(1e6);
  rep(i,0,1e6)C[i]=(__builtin_popcount(i)%2?-1:1);
  vm ans(M+1);
  rep(i,1,M+1){
  	rep(j,0,sz(D[i]))rep(k,1<<j,2<<j)T[k]=T[k-(1<<j)]*D[i][j];
  	rep(j,0,1<<sz(D[i]))ans[i]+=C[j]*F[T[j]].pow(i/T[j]);
  }
  ans.erase(ans.begin());
  cout<<ans<<endl;
  return 0;
}