#include int main () { int n = 0; int b = 0; int a = 0; int res = 0; int pow2[100001] = {}; int flag[100000] = {}; int cnt = 0; res = scanf("%d", &n); res = scanf("%d", &b); pow2[0] = 1; for (int i = 0; i < n; i++) { pow2[i+1] = pow2[i]*2; pow2[i+1] %= b; } for (int i = 0; i < n; i++) { res = scanf("%d", &a); if (flag[a-1] > 0) { printf("%d\n", pow2[n]); } else { flag[a-1] = 1; cnt++; printf("%d\n", (pow2[n]+b-pow2[n-cnt])%b); } } return 0; }