# https://yukicoder.me/problems/no/1667



class CombinationCalculator:
    """
    modを考慮したPermutation, Combinationを計算するためのクラス
    """    
    def __init__(self, size, mod):
        self.mod = mod
        self.factorial = [0] * (size + 1)
        self.factorial[0] = 1
        for i in range(1, size + 1):
            self.factorial[i] = (i * self.factorial[i - 1]) % self.mod
        
        self.inv_factorial = [0] * (size + 1)
        self.inv_factorial[size] = pow(self.factorial[size], self.mod - 2, self.mod)

        for i in reversed(range(size)):
            self.inv_factorial[i] = ((i + 1) * self.inv_factorial[i + 1]) % self.mod

    def calc_combination(self, n, r):
        if n < 0 or n < r or r < 0:
            return 0

        if r == 0 or n == r:
            return 1
        
        ans = self.inv_factorial[n - r] * self.inv_factorial[r]
        ans %= self.mod
        ans *= self.factorial[n]
        ans %= self.mod
        return ans
    
    def calc_permutation(self, n, r):
        if n < 0 or n < r:
            return 0

        ans = self.inv_factorial[n - r]
        ans *= self.factorial[n]
        ans %= self.mod
        return ans
        
def main():
    N, MOD = map(int, input().split())

    # サイズn の全域木を求める
    all_tree_size = [0] * (N + 1)
    for n in range(1, N + 1):
        if n in (1, 2):
            all_tree_size[n] = 1
        else:
            x = pow(n, n -2 , MOD)
            y = pow(n - 1, n - 3, MOD)
            y = pow(y, MOD - 2, MOD)
            ad = (x * y) % MOD
            all_tree_size[n] = (all_tree_size[n - 1] * ad) % MOD
            all_tree_size[n] %= MOD    

    dp = [[0] * N for _ in range(N + 1)]
    dp[N][0] = 1
    combi = CombinationCalculator(N, MOD)
    for n in reversed(range(N + 1)):
        for m in range(N):
            for l in range(n):
                use_node_num = 1 + l
                use_edge_num = l
                # 残りの超点数
                rest_node_num = n - (use_node_num)

                if m + use_edge_num < N:
                    ans =(all_tree_size[use_node_num] * dp[n][m]) % MOD
                    ans *= combi.calc_combination(n - 1, l)
                    ans %= MOD
                    dp[rest_node_num][m + use_edge_num] +=  ans
                    dp[rest_node_num][m + use_edge_num] %= MOD

    for i in range(N):
        print(dp[0][i])








        










if __name__ == "__main__":
    main()