Konduktor

Conductor Konrad inspects tickets on the trains of one of two large railway companies.

His train has $N$ compartments numbered from $1$ to $N$. Starting at compartment $1$, Konrad visits the compartments in this order: $1, 2, \dots, N-1, N, N-1, \dots, 2, 1, 2, \dots$. In other words, he walks from compartment $1$ out to compartment $N$ and back again, repeating this back-and-forth motion forever.

Given the number of compartments $N$ and the total number of visited compartments $K$, determine how many times Konrad visited each compartment.

The first line contains a natural number $Z$ ($1 \le Z \le 10$), the number of test sets. The test sets follow, one after another.

Each test set consists of a single line with two natural numbers $N$ ($1 \le N \le 10^6$) and $K$ ($1 \le K \le 10^9$), separated by a space. Here $N$ is the number of compartments and $K$ is the total number of visited compartments.

For each test set, print on its own line the $N$ integers $A_1, A_2, \dots, A_N$ separated by spaces, where $A_i$ is the number of ticket inspections carried out in compartment $i$.