Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Secret

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe 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 ≤*i*<*j*≤*k*) the intersection of sets*U*_{i}and*U*_{j}is an empty set; - the union of sets
*U*_{1},*U*_{2}, ...,*U*_{k}is set (1, 2, ...,*n*); - in each set
*U*_{i}, its elements*u*_{i, 1},*u*_{i, 2}, ...,*u*_{i, |Ui|}do not form an arithmetic progression (in particular, |*U*_{i}| ≥ 3 should hold).

Let us remind you that the elements of set (*u*_{1}, *u*_{2}, ..., *u*_{s}) form an arithmetic progression if there is such number *d*, that for all *i* (1 ≤ *i* < *s*) fulfills *u*_{i} + *d* = *u*_{i + 1}. For example, the elements of sets (5), (1, 10) and (1, 5, 9) form arithmetic progressions and the elements of sets (1, 2, 4) and (3, 6, 8) don't.

Your task is to find any partition of the set of words into subsets *U*_{1}, *U*_{2}, ..., *U*_{k} so that the secret is safe. Otherwise indicate that there's no such partition.

Input

The input consists of a single line which contains two integers *n* and *k* (2 ≤ *k* ≤ *n* ≤ 10^{6}) — the number of words in the secret and the number of the Keepers. The numbers are separated by a single space.

Output

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.

Examples

Input

11 3

Output

3 1 2 1 1 2 3 2 2 3 1

Input

5 2

Output

-1

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/25/2019 07:51:26 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|