#include<bits/stdc++.h>
using namespace std;

using ll=long long;
using pii=pair<int,int>;
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())

const int N=405;
int mod;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; y>>=1,x=mul(x,x)) if(y&1) res=mul(res,x); return res;}

int n,C[N][N],val[N],color[N],dp[N][N],connect[N],dp2[N][N],res[N];

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> n >> mod;
    C[0][0]=1;
    for(int i=1; i<N; ++i) for(int j=0; j<=i; ++j){
        if(j==0||j==i) C[i][j]=1;
        else C[i][j]=add(C[i-1][j-1],C[i-1][j]);
    }
    val[0]=1;
    for(int i=1; i<N; ++i) for(int j=0; j<i-1; ++j) val[i]=add(val[i],mul(val[j],val[i-2-j]));
    color[0]=1;
    for(int i=1; i<N/2; ++i){
        for(int j=0; j<=i; ++j) color[i]=add(color[i],mul(C[i*2][j*2],mul(val[j*2],val[(i-j)*2])));
        //if(i<=10) cout << i << ' ' << val[i] << ' ' << color[i] << endl;
    }
    connect[0]=1;
    dp[1][1]=dp[2][2]=1;
    for(int i=1; i<=n; ++i){
        connect[i]=color[i];
        for(int j=2; j<=i*2; j+=2){
            int de=0;
            for(int cnt=2; cnt<=j&&cnt<i*2; cnt+=2) de=add(de,mul(dp[j][cnt],connect[cnt/2]));
            de=mul(de,color[i-j/2]);
            connect[i]=sub(connect[i],de);
        }
        for(int j: {i*2+1,i*2+2}){
            for(int cnt=1; cnt<=j; ++cnt){
                for(int k=0; k+1<j; k+=2) dp[j][cnt]=add(dp[j][cnt],mul(dp[j-1-k][cnt-1],color[k/2]));
            }
        }
    }
    for(int i=1; i<=n; ++i) connect[i]=mul(connect[i],(mod+1)/2);
    res[0]=1;
    dp2[1][1]=dp2[2][2]=1;
    for(int i=1; i<=n; ++i){
        for(int j=2; j<=i*2; j+=2){
            int de=0;
            for(int cnt=2; cnt<=j; cnt+=2) de=add(de,mul(dp2[j][cnt],connect[cnt/2]));
            de=mul(de,res[i-j/2]);
            res[i]=add(res[i],de);
        }
        for(int j: {i*2+1,i*2+2}){
            for(int cnt=1; cnt<=j; ++cnt){
                for(int k=0; k+1<j; k+=2) dp2[j][cnt]=add(dp2[j][cnt],mul(dp2[j-1-k][cnt-1],res[k/2]));
            }
        }
    }
    for(int i=1; i<=n; ++i) cout << res[i] << "\n";
}