CF271C Secret

The Greatest Secret Ever consists of $ n $ words, indexed by positive integers from $ 1 $ to $ n $ . The secret needs dividing between $ k $ Keepers (let's index them by positive integers from $ 1 $ to $ k $ ), the $ i $ -th Keeper gets a non-empty set of words with numbers from the set $ U_{i}=(u_{i,1},u_{i,2},...,u_{i,|Ui}|) $ . Here and below we'll presuppose that the set elements are written in the increasing order. We'll say that the secret is safe if the following conditions are hold: - for any two indexes $ i,j $ ( $ 1

The input consists of a single line which contains two integers $ n $ and $ k $ ( $ 2

If there is no way to keep the secret safe, print a single integer "-1" (without the quotes). Otherwise, print $ n $ integers, the $ i $ -th of them representing the number of the Keeper who's got the $ i $ -th word of the secret. If there are multiple solutions, print any of them.