HRY and balls 2
题号:NC25454
时间限制:C/C++/Rust/Pascal 2秒,其他语言4秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld

题目描述

Define f(n,m) as the number of ways to put n different balls to m identical boxes, each box must contain at least one ball.
Given a positive integer n, please calculate :


for each .

输入描述:

A positive integer n. 

输出描述:

Output n lines, an integer per line. The integer in the m-th line represents the result of .
示例1

输入

复制
3

输出

复制
1
2
5