#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll N, B; cin >> N >> B;
    vector<ll> A(N);
    rep(i, N){
        cin >> A[i];
        A[i]--;
    }

    vector<ll> pow2(N+1, 1LL);
    for(ll i=1; i<=N; i++) pow2[i] = pow2[i-1]*2LL%B;

    vector<bool> check(N, false);
    ll cnt = 0;
    for(ll r=0; r<N; r++){
        if(check[A[r]]){
            cout << pow2[N] << '\n';
        }else{
            ll ans = pow2[N-1];
            ans = (ans + (pow2[cnt]-1LL+B)%B*pow2[N-cnt-1]%B)%B;
            cout << ans << '\n';

            check[A[r]]=true;
            cnt++;
        }
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}