#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::Read;

#[allow(dead_code)]
fn getline() -> String {
    let mut ret = String::new();
    std::io::stdin().read_line(&mut ret).ok().unwrap();
    ret
}

fn get_word() -> String {
    let stdin = std::io::stdin();
    let mut stdin=stdin.lock();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}

#[allow(dead_code)]
fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }

fn solve() {
    let n: usize = get();
    let m: i64 = get();
    let lim = n * (n - 1) / 2 + 1;
    let mut dp = vec![vec![0; lim]; n + 1];
    dp[0][0] = 1;
    for i in 0..2 * n {
        let mut ep = vec![vec![0; lim]; n + 1];
        for j in 0..n + 1 {
            if j > i + 1 { continue; }
            if (i + 1 + j) % 2 != 0 { continue; }
            let opp = (i + 1 - j) / 2;
            for k in 0..lim {
                if j > 0 && k >= opp {
                    ep[j][k] += dp[j - 1][k - opp];
                    ep[j][k] %= m;
                }
                if j < n {
                    ep[j][k] += dp[j + 1][k];
                    ep[j][k] %= m;
                }
            }
        }
        dp = ep;
    }
    for i in 0..n * n {
        println!("{}", if i >= lim { 0 } else { dp[0][i] });
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}