CF888D.Almost Identity Permutations

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

A permutation $p$ of size $n$ is an array such that every integer from $1$ to $n$ occurs exactly once in this array.

Let's call a permutation an almost identity permutation iff there exist at least $n-k$ indices $i$ ( $1<=i<=n$ ) such that $p_{i}=i$ .

Your task is to count the number of almost identity permutations for given numbers $n$ and $k$ .

The first line contains two integers $n$ and $k$ ( $4<=n<=1000$ , $1<=k<=4$ ).

Print the number of almost identity permutations for given $n$ and $k$ .