Odd Strings

You are given two integers $N$ and $K$. Construct any binary string $S$ of length $N$ such that exactly $K$ of its **odd-length** substrings have mode equal to $1$. If no such string exists, print $-1$. ---- **Note:** The *mode* of a string is the character that appears in it the most number of times. For a binary string of odd length, the mode is always uniquely $0$ or $1$. ### Input - The fi