#include <bits/stdc++.h>
#include "atcoder/all"
#define debug cout << "OK" << endl;
template<typename T>
inline bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
inline bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
inline int Code(char c) {
	if ('A' <= c and c <= 'Z')return (int)(c - 'A');
	if ('a' <= c and c <= 'z')return (int)(c - 'a');
	if ('0' <= c and c <= '9')return (int)(c - '0');
	assert(false);
}
using namespace std;
using namespace atcoder;
#define int long long
constexpr int MOD = 998244353;
constexpr int INF = (1LL << 63);
using minit = modint998244353;

template<typename T>
ostream& operator << (ostream& st, const vector<T>& v) {
	for (const T value : v) {
		st << value << " ";
	}
	return st;
}
template<typename T>
istream& operator >> (istream& st, vector<T>& v) {
	for (T& value : v) {
		st >> value;
	}
	return st;
}

struct edge {
	int to, cost;
};
int Rand() {
	return (rand() % 32768) * 32768 + (rand() % 32768);
}
int pow_(const int a, const int b, const int m = INF) {
	int res = 1;
	int base = a;
	for (int i = 0; i < 64; i++) {
		if (b & (1ll << i))res *= base;
		res %= m;
		base = base * base;
		base %= m;
	}
	return res;
}

//

//

class Solver {
public:
	int T;
	Solver() :T(1) {}
	~Solver(){}
	void multi();
	void solve() const;
	void sp(int x)const;
};
void Solver::multi() {
	cin >> T;
	return;
}
void Solver::sp(const int x)const {
	cout << fixed << setprecision(x) << endl;
	return;
}

void Solver::solve() const {
	int N, M;
	cin >> N >> M;
	vector<int> A(N);
	cin >> A;
	vector<int> cnt(M + 1, 0);
	for (const int a : A) {
		cnt[a]++;
	}
	vector<int> ans(M + 1, 0);
	for (int k = M; 1 <= k; k--) {
		int pk = 0;
		minit res = 0;
		for (int e = 1; e * k <= M; e++) {
			pk += cnt[e * k];
			res -= ans[e * k];
		}
		res += pow_(2, pk, MOD) - 1;
		ans[k] = res.val();
	}
	for (int i = 1; i <= M; i++)
		cout << ans[i] << endl;
}

signed main() {
	Solver solver;
	//solver.multi();
	//solver.sp();
	for (int i = 0; i < solver.T; i++)
		solver.solve();
	return 0;
}

/*
* わらびのコードこーどすぺーす
 (σ･∀･)σｹﾞｯﾂ!!
*/