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.
#include <iostream>
#include <cmath>
#include <cstring>
#include <fstream>
#include <map>
#include <string>
#include <set>
#include <bitset>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <algorithm>
using namespace std;
#define FIn ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define pf push_front
#define pb push_back
typedef unsigned int ui;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef map<int,int> mpii;
typedef map<char,int> mpci;
typedef pair<int,int> pii;


int main() {
    int n,k; scanf("%d%d", &n,&k);
    for (int i=0;i<n-k-1; i++) printf("%d ", i+1);
    printf("%d ", n);
    for (int i=0;i<k; i++) printf("%d ", n-i-1);
}