K-skip Permutation
题号:NC236062
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 512 M,其他语言1024 M
Special Judge, 64bit IO Format: %lld

题目描述

For a permutation of n, let f(P, k) be the number of i satisfying and .
Given two integers n and k, your task is to find a permutation P of n such that f(P, k) is maximized.
Recall that in a permutation of n, each integer from 1 to n (both inclusive) appears exactly once.

输入描述:

There is only one test case in each test file.
The first and only line contains two integers n and k ().

输出描述:

Output one line containing n integers indicating a permutation P of n that maximizes f(P, k). If there are multiple valid answers you can output any of them.
Please, DO NOT output extra spaces at the end of the line, or your answer may be considered incorrect!
示例1

输入

复制
3 1

输出

复制
1 2 3
示例2

输入

复制
7 3

输出

复制
2 5 1 4 7 3 6
示例3

输入

复制
3 7

输出

复制
1 3 2