输入：

每组输入是两个整数n和k。(1 <= n <= 50, 1 <= k <= n)

输出：

对于每组输入，请输出六行。

第一行： 将n划分成若干正整数之和的划分数。

第二行： 将n划分成k个正整数之和的划分数。

第三行： 将n划分成最大数不超过k的划分数。

第四行： 将n划分成若干奇正整数之和的划分数。

第五行： 将n划分成若干不同整数之和的划分数。

第六行： 打印一个空行。

Sample Input

5 2

Sample Output

7

2

3

3

3

-Input:

Each group of input are two integers n and k.(1 < = n < = 50, 1 < = k < = n)

Output:

For each group of input and output six lines, please.

The first line: will be divided into n division of the sum of the positive integer number.

The second line: will be divided into n k a division of the sum of the positive integer number.

The third line: will be divided into a maximum number of n number for the division of no more than k.

In the fourth row, will be divided into n no division of the sum of the integer number.

Line 5: will be divided into several different n the division of the sum of an integer number.

Line 6: print a blank line.

The Sample Input

5, 2

The Sample Output

7

2

3

3

3

, �　�　�　�　Version: 1.0 StartHTML: 0000000221 EndHTML: 0000024416 StartFragment: 0000022112 EndFragment: 0000024376 SourceURL: file:///E:\algorithms_experiment\jgshi_lab\SA12226431_ Shi Jiangang \ try 1 _ integer division \ integer division. Doc