#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

const ll MOD=998244353;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m;
    cin>>n>>m;
    vector<ll>P(n+1);
    P[0]=1;
    rep(i,n)P[i+1]=2*P[i]%MOD;
    vector<int>a(n),c(m+1);
    rep(i,n){
        cin>>a[i];
        int b=1;
        while(b*b<=a[i]){
            if(a[i]%b==0){
                c[b]++;
                if(b*b<a[i])c[a[i]/b]++;
            }
            b++;
        }
    }
    vector<ll>ans(m+1);
    for(int i=m;i>=1;i--){
        ans[i]=P[c[i]]-1;
        for(int j=2*i;j<=m;j+=i){
            ans[i]-=ans[j];
            ans[i]%=MOD;
            if(ans[i]<0)ans[i]+=MOD;
        }
    }
    for(int i=1;i<=m;i++)cout<<ans[i]<<"\n";
}