from collections import *
import sys
import heapq
import bisect
import itertools
from functools import lru_cache
import math


dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0))
dxdy2 = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1))
dxdy3 = ((0, 1), (1, 0))
dxdy4 = ((1, 1), (1, -1), (-1, 1), (-1, -1))
INF = float("inf")
MOD = 998244353
mod = 998244353
MOD2 = 10**9 + 7
mod2 = 10**9 + 7
# memo : len([a,b,...,z])==26

input = lambda: sys.stdin.readline().rstrip()
mi = lambda: map(int, input().split())
li = lambda: list(mi())

N, B = mi()
A = li()
for r in range(1, N + 1):
    ans = (pow(2, r, B) - 1) * pow(2, N - r, B)
    if A[0] == A[r-1] and r!=1:
        ans += 1
    print(ans % B)