We’re preparing your current view and syncing the latest data.
Given two integers n and k, compute the value of the product: C(n,1) * C(n,2) * ... * C(n,k), where C(n, i) is the combination function (binomial coefficient) representing the number of ways to choose i elements from a set of n elements.
The input consists of two integers n and k separated by a space.
Output a single integer which is the product of C(n,i) for all i = 1 to k.
1 <= k <= n <= 1000