// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        m: usize,
    }
    let pow = |mut r: usize, mut n: usize| -> usize {
        let mut t = 1;
        while n > 0 {
            if n & 1 == 1 {
                t = t * r % m;
            }
            r = r * r % m;
            n >>= 1;
        }
        t
    };
    let mut fact = vec![1; n + 1];
    for i in 1..=n {
        fact[i] = fact[i - 1] * i % m;
    }
    let mut ifact = vec![1; n + 1];
    ifact[n] = pow(fact[n], m - 2);
    for i in (1..n).rev() {
        ifact[i] = (i + 1) * ifact[i + 1] % m;
    }
    let binom = |n: usize, k: usize| -> usize {
        fact[n] * ifact[k] % m * ifact[n - k] % m
    };
    let mut dp = vec![vec![0; n]; n + 1];
    dp[0][0] = 1;
    dp[1][0] = 1;
    for n in 2..=n {
        for e in 0..n {
            let mut val = dp[n - 1][e];
            for i in 1..=e {
                val = (val + pow(i + 1, i - 1) * binom(n - 1, i) % m * dp[n - i - 1][e - i]) % m;
            }
            dp[n][e] = val;
        }
    }
    for i in 0..n {
        println!("{}", dp[n][i]);
    }
}

fn main() {
    run();
}