#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, M;
  cin >> N >> M;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> cnt(M + 1, 0);
  for (int i = 0; i < N; i++){
    cnt[A[i]]++;
  }
  vector<long long> POW(N + 1);
  POW[0] = 1;
  for (int i = 0; i < N; i++){
    POW[i + 1] = POW[i] * 2 % MOD;
  }
  vector<long long> B(M + 1, 0);
  for (int i = 1; i <= M; i++){
    for (int j = i; j <= M; j += i){
      B[i] += cnt[j];
    }
    B[i] = POW[B[i]] - 1;
  }
  for (int i = M; i >= 1; i--){
    for (int j = i * 2; j <= M; j += i){
      B[i] += MOD - B[j];
    }
    B[i] %= MOD;
  }
  for (int i = 1; i <= M; i++){
    cout << B[i] << endl;
  }
}