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*<sub class="lower-index">*i*</sub> = (*u*<sub class="lower-index">*i*, 1</sub>, *u*<sub class="lower-index">*i*, 2</sub>, ..., *u*<sub class="lower-index">*i*, |*U*<sub class="lower-index">*i*</sub>|</sub>). 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* &lt; *j* ≤ *k*) the intersection of sets *U*<sub class="lower-index">*i*</sub> and *U*<sub class="lower-index">*j*</sub> is an empty set; -  the union of sets *U*<sub class="lower-index">1</sub>, *U*<sub class="lower-index">2</sub>, ..., *U*<sub class="lower-index">*k*</sub> is set (1, 2, ..., *n*); -  in each set *U*<sub class="lower-index">*i*</sub>, its elements *u*<sub class="lower-index">*i*, 1</sub>, *u*<sub class="lower-index">*i*, 2</sub>, ..., *u*<sub class="lower-index">*i*, |*U*<sub class="lower-index">*i*</sub>|</sub> do not form an arithmetic progression (in particular, |*U*<sub class="lower-index">*i*</sub>| ≥ 3 should hold). 
Let us remind you that the elements of set (*u*<sub class="lower-index">1</sub>, *u*<sub class="lower-index">2</sub>, ..., *u*<sub class="lower-index">*s*</sub>) form an arithmetic progression if there is such number *d*, that for all *i* (1 ≤ *i* &lt; *s*) fulfills *u*<sub class="lower-index">*i*</sub> + *d* = *u*<sub class="lower-index">*i* + 1</sub>. 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*<sub class="lower-index">1</sub>, *U*<sub class="lower-index">2</sub>, ..., *U*<sub class="lower-index">*k*</sub> 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 ≤ *k* ≤ *n* ≤ 10<sup class="upper-index">6</sup>) — the number of words in the secret and the number of the Keepers. The numbers are separated by a single space.
import sys
input = sys.stdin.readline
n, k = map(int,input().split())
if n//k < 3 :
    print(-1)
else :
    ans = []
    for i in range(k-1) :
        ans.append(i+2)
    ans.append(1)
    for i in range(n-k) :
        ans.append(i%k+1)
    print(*ans)