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-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/19/2018 16:57:59 (d2).

Desktop version, switch to mobile version.

User lists

Name |
---|