KING$-$DREAMS$-$I

Once upon a time, a King saw a dream, where if his kingdom has food line of tanks. meaning tanks lined up side by side in a certain way, they will become invincible.

Now, since you are the advior of the king, he has asked you to create a good line of tanks.

There are $"$ types of tanks, numbered i through $m,$ and we have infinite amount of tanks for each type.

Come up with a good line of size $n$ tanks. If there are multiple good line return one which is lexographically smallest.

good tine is a configuration where tanks lined up in an array and the count of subarrays with only distinct tank types is maximum. e$.$g $\{3,4,4,5\}$ contains $6$ subarrays with distinct tanks: $\{5)$

An array $x$ is lexicographically smaller than an array $y$ if there exists an index i such that $x{e}^{2}y,$ and $\frac{x}{?}=y$ for all

Constraints

Input Format

The only line contain space seperated integer values $n$ and $m,$ where $nis$ the size $of$ good line $mis$ the number $oftank$ types

Output Format

Return a list $of$ size $n.$

Sample Input

Example $1$

Input: $12$

Output: $11j.$ Less formally, $at$ the first index $tin$ which they differ, $i$

Constraints

Input Format

The only line contain space seperated integer values $n$ and $m,$ where $nis$ the size $of$ good line $mis$ the number $oftank$ types

Output Format

Return a list $of$ size $n.$

Sample Input

Example $1$

Input: $12$

Output: $1$