361B.md (1462B)
1 Source: https://codeforces.com/problemset/problem/361/B 2 3 B. Levko and Permutation 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 Levko loves permutations very much. A permutation of length *n* is a sequence of distinct positive integers, each is at most *n*. 22 23 Let’s assume that value *gcd*(*a*, *b*) shows the greatest common divisor of numbers *a* and *b*. Levko assumes that element *p**i* of permutation *p*1, *p*2, ... , *p**n* is good if *gcd*(*i*, *p**i*) > 1. Levko considers a permutation beautiful, if it has exactly *k* good elements. Unfortunately, he doesn’t know any beautiful permutation. Your task is to help him to find at least one of them. 24 25 Input 26 27 The single line contains two integers *n* and *k* (1 ≤ *n* ≤ 105, 0 ≤ *k* ≤ *n*). 28 29 Output 30 31 In a single line print either any beautiful permutation or -1, if such permutation doesn’t exist. 32 33 If there are multiple suitable permutations, you are allowed to print any of them. 34 35 Examples 36 37 Input 38 39 ``` 40 4 2 41 ``` 42 43 Output 44 45 ``` 46 2 4 3 1 47 ``` 48 49 Input 50 51 ``` 52 1 1 53 ``` 54 55 Output 56 57 ``` 58 -1 59 ``` 60 61 Note 62 63 In the first sample elements 4 and 3 are good because *gcd*(2, 4) = 2 > 1 and *gcd*(3, 3) = 3 > 1. Elements 2 and 1 are not good because *gcd*(1, 2) = 1 and *gcd*(4, 1) = 1. As there are exactly 2 good elements, the permutation is beautiful. 64 65 The second sample has no beautiful permutations.