#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mpow(ll a, ll n, ll b) {
	ll ret = 1;
	while (n) {
		if (n & 1) ret = (ret * a) % b;
		n >>= 1;
		a = (a * a) % b;
	}
	return ret;
}
int main () {
	int N;
	cin >> N;
	ll B;
	cin >> B;
	std::vector<int> A(N + 1, 0);
	int siz = 0;
	for (int i = 0; i < N; i ++) {
		int a;
		cin >> a;
		if (A[a]) {
			cout << mpow(2, N, B) << endl;
		} else {
			siz ++;
			ll ans = mpow(2, N, B) - mpow(2, N - siz, B);
			ans = (ans + B) % B;
			A[a] = 1;
			cout << ans << endl;
		}
	}
}