Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Slightly Decreasing Permutations

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPermutation *p* is an ordered set of integers *p*_{1}, *p*_{2}, ..., *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*_{1}, *p*_{2}, ..., *p*_{n}.

The decreasing coefficient of permutation *p*_{1}, *p*_{2}, ..., *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^{5}, 0 ≤ *k* < *n*) — the permutation length and the decreasing coefficient.

Output

In a single line print *n* space-separated integers: *p*_{1}, *p*_{2}, ..., *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.

Examples

Input

5 2

Output

1 5 2 4 3

Input

3 0

Output

1 2 3

Input

3 2

Output

3 2 1

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/07/2020 01:45:21 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|