B. Permutation----思维题

B. Permutation

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A permutation p is an ordered group of numbers p1,   p2,   ...,   pn, consisting of n distinct positive integers, each is no more than n. We'll define number n as the length of permutation p1,   p2,   ...,   pn.

Simon has a positive integer n and a non-negative integer k, such that 2k ≤ n. Help him find permutation a of length 2n, such that it meets this equation: .

Input

The first line contains two integers n and k (1 ≤ n ≤ 50000, 0 ≤ 2k ≤ n).

Output

Print 2n integers a1, a2, ..., a2n — the required permutation a. It is guaranteed that the solution exists. If there are multiple solutions, you can print any of them.

Examples

input

1 0

output

1 2

input

2 1

output

3 2 1 4

input

4 0

output

2 7 4 6 1 3 5 8

Note

Record |x| represents the absolute value of number x.

In the first sample |1 - 2| - |1 - 2| = 0.

In the second sample |3 - 2| + |1 - 4| - |3 - 2 + 1 - 4| = 1 + 3 - 2 = 2.

In the third sample |2 - 7| + |4 - 6| + |1 - 3| + |5 - 8| - |2 - 7 + 4 - 6 + 1 - 3 + 5 - 8| = 12 - 12 = 0.

题目链接：http://codeforces.com/contest/359/problem/B

题目的意思是让你输出一个序列满足上述关系式。

因为题目让输出2*n个数，思路很简单，就是直接输出正整数序列，k为几则有几对对调。

认真反思一下这个题，我们稍微改一个条件，让你输出n个数，满足上述关系式，这个题就不好做了，需要把大数前移。

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(){
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=2*k;i+=2){
        printf(i==1?"%d %d":" %d %d",i+1,i);
    }
    for(int i=2*k+1;i<=2*n;i+=2){
        printf(i==1?"%d %d":" %d %d",i,i+1);
    }
    cout<<endl;
    return 0;
}