Codeforces Round #175 (Div. 2) A. Slightly Decreasing Permutations（构造，简单）

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 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 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

#include <iostream>
#include <fstream>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <utility>
using namespace std;
#define ll long long
#define cti const int
#define ctll const long long
#define dg(i) cout << '*' << i << endl;

int main()
{
    int n, k;
    while(scanf("%d %d", &n, &k) != EOF)
    {
        if(k == 0)
        {
            for(int i = 1; i < n; i++) cout << i << ' ';
            cout << n << endl;
            continue;
        }
        cout << n--;
        while(k-- > 1) cout << ' ' << n--;
        for(int i = 1; n--; i++) cout << ' ' << i;
        cout << endl;
    }
    return 0;
}