CF597C Subsequences

For the given sequence with $ n $ different elements find the number of increasing subsequences with $ k+1 $ elements. It is guaranteed that the answer is not greater than $ 8 \times 10^{18} $ .

First line contain two integer values $ n $ and $ k $ $ (1

Print one integer — the answer to the problem.