#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const long long modc = 998244353; long long mod_exp(long long b, long long e){ const long long m=modc; if (e > 0 && b == 0) return 0; long long ans = 1; b %= m; while (e > 0){ if ((e & 1LL)) ans = (ans * b) % m; e = e >> 1LL; b = (b*b) % m; } return ans; } int main(){ long long N, M; cin >> N >> M; vector A(N), c(M+1), cnt(M+1), ans(M+1); for (int i=0; i> A[i]; c[A[i]]++; } for (int i=1; i<=M; i++){ for (int j=i; j<=M; j+=i) cnt[i] += c[j]; } for (int i=M; i>=1; i--){ ans[i] = (modc+mod_exp(2, cnt[i])-1) % modc; for (int j=2*i; j<=M; j+=i){ ans[i] += modc - ans[j]; ans[i] %= modc; } } for (int i=1; i<=M; i++) cout << ans[i] << endl; return 0; }