CUIT ACM Personal Training 11.27(FM） H - Slightly Decreasing Permutations

H - Slightly Decreasing Permutations

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

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

Input

5 2

Output

1 5 2 4 3

Input

3 0

Output

1 2 3

Input

3 2

Output

3 2 1

题解：这道题其实可以理解成在n数字中，有k次发生前一项大于后一项的情况。

那么这个其实也是一道简单的贪心算法，如果较大的数字随机排布在n个数字中，就如样例1，有可能会符合题目，但是这只是一个特例。只有当我们从前倒序输出，输出k个数字之后再正序输出时，我们的结果才能保证正确。比如在5个数字中，找到2次发生前一项大于后一项的数列，那我们只要让5 4这样倒序输出，紧接着1 2 3输出，就能找到一组5 4 1 2 3符合题意

同理给出下面两组数据：

7 4

7 6 5 4 1 2 3

6 5

6 5 4 3 2 1

这些都是符合题意的结果。

AC代码如下：

#include<bits/stdc++.h>
using namespace std;

int n,m;

int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        if(i<=m) cout<<n-i+1<<" ";
        else cout<<i-m<<" ";
    cout<<endl;
    return 0;
}