#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}


using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}


const int N = 200000;
int meb[N+1];
vector<int> divs[N+1];
int cnt[N+1];
int cnt_mul[N+1];
mint pow2[N+1];

void init(){
    vector<int> cur(N+1);
    pow2[0] = 1;
    for(int x = 1; x <= N; x++){
        for(int i = 0; i*x <= N; i++){
            divs[i*x].push_back(x);
        }
        cur[x] = x;
        meb[x] = 1;
        pow2[x] = pow2[x-1]*2;
    }
    for(int x = 2; x <= N; x++){
        for(int i = 1; i*x <= N; i++){
            int cnt = 0;
            while(cur[x*i]%x == 0){
                cnt++;
                cur[x*i] /= x;
            }
            if(cnt >= 2){
                meb[x*i] = 0;
            }
            if(cnt == 1) meb[x*i] *= -1;
        }
    }

}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int n, m; cin >> n >> m;
    vector<int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        cnt[a[i]]++;
    }
    for(int x = 1; x <= N; x++){
        for(int y: divs[x]){
            cnt_mul[y]+=cnt[x];
        }
    }
    vector<mint> ans(m+1);
    for(int x = 1; x <= m; x++){
        int y = m/x;
        for(int z = 1; z*x <= m; z++){
            ans[x] += meb[z]*(pow2[cnt_mul[x*z]]-1);
        }
        cout << ans[x] << endl;
    }

}