K Distinct Array solution|Codesheff starter 25 for div 3

An array is said to be good if all its elements are distinct, i.e. no two elements of the array are equal to each other.

You are given a positive integer N$N$ and an integer K$K$ such that N≤K≤(N+12)$N\le K\le (\genfrac{}{}{0ex}{}{N+1}{2})$.

Construct an array A$A$ of length N$N$ that satisfies the following conditions

• A$A$ has exactly K$K$ good (contiguous) subarrays, and
• Every element of A$A$ is an integer from 1$1$ to N$N$ (both inclusive).

If there are multiple such arrays, you can print any of them.

Note: It can be shown that for all inputs satisfying the given constraints, there is always a valid solution.

Input Format

• The first line contains an integer T$T$, the number of testcases. The description of the T$T$ testcases follow.
• Each testcase consists of a single line with two space separated integers, N$N$ and K$K$ respectively.

Output Format

• For each testcase print N$N$ space separated integers, the elements of the constructed array.
• If there are multiple outputs, you can print any of them.
• Your output will be considered correct only if the following conditions are satisfied,
  • Every element of the array is between 1$1$ and N$N$, and
  • The array has exactly K$K$ good subarrays

Constraints

• 1≤T≤105$1\le T\le {10}^5$
• 1≤N≤105$1\le N\le {10}^5$
• N≤K≤(N+12)$N\le K\le (\genfrac{}{}{0ex}{}{N+1}{2})$
• Sum of N$N$ over all testcases is atmost 3⋅105$3\cdot {10}^5$.

Sample Input 1 

3
5 5
5 15
5 7

Sample Output 1 

1 1 1 1 1
1 2 3 4 5
1 2 2 1 1

Solution:

click here for solution