B'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 Ui xe2 x80 x89= xe2 x80 x89(ui, xe2 x80 x891, xe2 x80 x89ui, xe2 x80 x892, xe2 x80 x89..., xe2 x80 x89ui, xe2 x80 x89|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: Let us remind you that the elements of set (u1, xe2 x80 x89u2, xe2 x80 x89..., xe2 x80 x89us) form an arithmetic progression if there is such number d, that for all i (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89< xe2 x80 x89s) fulfills ui xe2 x80 x89+ xe2 x80 x89d xe2 x80 x89= xe2 x80 x89ui xe2 x80 x89+ xe2 x80 x891. For example, the elements of sets (5), (1, xe2 x80 x8910) and (1, xe2 x80 x895, xe2 x80 x899) form arithmetic progressions and the elements of sets (1, xe2 x80 x892, xe2 x80 x894) and (3, xe2 x80 x896, xe2 x80 x898) don 't. Your task is to find any partition of the set of words into subsets U1, xe2 x80 x89U2, xe2 x80 x89..., xe2 x80 x89Uk so that the secret is safe. Otherwise indicate that there 's no such partition. The input consists of a single line which contains two integers n and k (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106) -- the number of words in the secret and the number of the Keepers. The numbers are separated by a single space. 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.'...