Permutation *p* is an ordered set of integers *p*<sub class="lower-index">1</sub>,  *p*<sub class="lower-index">2</sub>,  ...,  *p*<sub class="lower-index">*n*</sub>, 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*<sub class="lower-index">*i*</sub>. We'll call number *n* the size or the length of permutation *p*<sub class="lower-index">1</sub>,  *p*<sub class="lower-index">2</sub>,  ...,  *p*<sub class="lower-index">*n*</sub>.

The decreasing coefficient of permutation *p*<sub class="lower-index">1</sub>, *p*<sub class="lower-index">2</sub>, ..., *p*<sub class="lower-index">*n*</sub> is the number of such *i* (1 ≤ *i* &lt; *n*), that *p*<sub class="lower-index">*i*</sub> &gt; *p*<sub class="lower-index">*i* + 1</sub>.

You have numbers *n* and *k*. Your task is to print the permutation of length *n* with decreasing coefficient *k*.
The single line contains two space-separated integers: *n*, *k* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 0 ≤ *k* &lt; *n*) — the permutation length and the decreasing coefficient.
# Library Imports
from math import sqrt,ceil,floor
import sys
from collections import Counter,deque
from collections import defaultdict as dd


# Debug Function
# def variablename(variable):
#     for name in globals():
#         if eval(name) == variable:
#             return name
# def debug(x):
#     print(f"{variablename(x)}={x}")



# Code Here

def foo(x):
    for i in range(len(x)):
        if x[i] not in ['4','7']:
            return "NO"
    return "YES"



# MultiTestCase

# t=int(input())
# for tt in range(t):
    
# n=list(input())
n,k=map(int,input().split())
k+=1
arr=list(range(1,n-k+1))
for i in range(n,n-k,-1):
    arr.append(i)
print(arr)
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    



