Gcd of Subarrays

You are given positive integers $N$ and $K$. You have to construct an array $A$ of length $N$ such that : - $1 \leq A_i \leq 10^{18}$ - $\sum_{i=1}^{N} \sum_{j=i}^{N} F(i,j) = K$, where $F(i,j)$ denotes the [gcd](https://en.wikipedia.org/wiki/Greatest_common_divisor) of all elements of the subarray $A[i, j]$. If multiple such arrays exist, print any. Report $-1$ if no such array exists. No