Integer Partition

Problem Description

Partition the integer $n$ into $k$ parts, where each part is non-empty, and two partitions that differ only in order are considered the same (order is not considered).

For example, for $n=7$, $k=3$, the following three partitions are considered the same:

$1,1,5$; $1,5,1$; $5,1,1$.

How many different partitions are there?

Input Format

$n,k$ ($6<n\le 200$, $2\le k\le 6$)

Output Format

One integer: the number of different partitions.

Sample Input 1

7 3

Sample Output 1

4

Hint

The four partitions are:

$1,1,5$; $1,2,4$; $1,3,3$; $2,2,3$.

Source: NOIP 2001, Senior Group, Problem 2.