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.
n,k = map(int,input().split())
out=[]
ls=[i for i in range(1,n+1)]

def swap(ls,k):
    c=0
    p=0
    while(c<n-1) and (p<k):
        ls[c],ls[c+1]=ls[c+1],ls[c]
        c+=2
        p+=1        
            
    return ls
    
        
    
if(k==0):
    for i in range(1,n+1):
        out.append(i)
elif(k==n-1):
    for i in range(1,n+1):
        out.append(n+1-i)
else:
    swap(ls,k)
    out=ls
    
    
print(*out, sep=' ')
