Slightly Decreasing Permutations

2000ms

262144K

Description:

Permutation p is an ordered set of integers p₁, p₂, ..., p_n, consisting of n distinct positive integers, each of them doesn't exceed n. We'll denote the i-th element of permutation p as p_i. We'll call number n the size or the length of permutation p₁, p₂, ..., p_n.

The decreasing coefficient of permutation p₁, p₂, ..., p_n is the number of such i (1 ≤ i < n), that p_i > p_i + 1.

You have numbers n and k. Your task is to print the permutation of length n with decreasing coefficient k.

Input:

The single line contains two space-separated integers: n, k (1 ≤ n ≤ 10⁵, 0 ≤ k < n) — the permutation length and the decreasing coefficient.

Output:

In a single line print n space-separated integers: p₁, p₂, ..., p_n — the permutation of length n with decreasing coefficient k.

If there are several permutations that meet this condition, print any of them. It is guaranteed that the permutation with the sought parameters exists.

Sample Input:

5 2

Sample Output:

1 5 2 4 3

Sample Input:

3 0

Sample Output:

1 2 3

Sample Input:

3 2

Sample Output:

3 2 1

Informação

Provedor Codeforces

Código CF285A