#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template <typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

using mint = modint;

const int M = 100005;

int main(){
	int n, b;
	cin >> n >> b;
	vi a(n);
	cin >> a;
	rep(i, n) a[i]--;
	mint::set_mod(b);
	vector<mint> bi(M);
	bi[0] = 1;
	rep(i, M - 1) bi[i + 1] = bi[i] * 2;
	set<int> se;
	rep(i, n){
		mint ans;
		int k = int(se.size()) + 1;
		if(se.find(a[i]) == se.end()) ans = (bi[k] - 1) * bi[n - k];
		else ans = bi[n];
		cout << ans << "\n";
		se.insert(a[i]);
	}
	return 0;
}