A. Slightly Decreasing Permutations

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 permutationp₁,  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 test(s)

input

5 2

output

1 5 2 4 3

input

3 0

output

1 2 3

input

3 2

output

3 2 1

解题说明：此题就是输出1到n一串数字，其中保证存在k个前一个数大于后一个数的情况。很显然不可能把这些数存起来，为了简单只需要把最大的k个数字移到最前面即可，然后再从小到大输出剩下的数。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
	int n,k;
	int i;
	scanf("%d %d",&n,&k);
	for(i=0;i<k;i++)
	{
		printf("%d ",n-i);
	}
	for(i=1;i<=n-k;i++)
	{
		printf("%d ",i);
	}
	printf("\n");
	return 0;
}