Help Nishant

Nishant does pretty weird stuff. Today, he wants to create a weird sequence. According to Nishant, a sequence $A$ of length $N$ is called weird if: - $N \geq 3$ - $2 \cdot A_i > A_{i-1} + A_{i+1} \ \forall i \in \{2,3,4....,N-1\}$ Nishant wants to construct a long weird sequence to impress his weird friends, but there's a problem: he only knows how to count up to $K$, so the sequence can only