#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#include<atcoder/modint>

using mint = atcoder::modint;
int main(){
    
    int n,b;
    cin>>n>>b;
    mint::set_mod(b);

    int cnt = 0;
    vector<int> now(n,0);
    vector<int> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    bool ok = true;
    int all = 0;
    for(int i = 0;i<n;i++){
        a[i]--;
        now[a[i]]++;
        mint ans = mint(2).pow(n);
        if(now[a[i]]==1) all++;
        if(now[a[i]]==1) ans -= mint(2).pow(n-all);
        cout<<ans.val()<<endl;
    }
}