Playlist Shuffle Sequence Generator

You are given a music playlist consisting of M unique songs numbered from 1 to M. Your task is to generate a valid shuffle sequence that reorders these songs. In each test case, you are given three integers M, G, and B. Although the constraints (within G songs and after more than B songs) are provided for context, a simple valid sequence is any permutation of the M songs.

Note: In this problem, you can output any valid permutation of the songs. For simplicity, the identity order (i.e., 1, 2, 3, …, M) is acceptable.

inputFormat

The first line contains an integer T, the number of test cases. Each test case consists of three space-separated integers: M, G, and B, where

• M is the number of songs.
• G represents the 'within G songs' constraint.
• B represents the 'after more than B songs' constraint.

All input is read from standard input (stdin).

outputFormat

For each test case, output a single line that contains a valid shuffle sequence of the song IDs separated by a space. The output should be written to standard output (stdout).

## sample

3
5 2 3
7 3 4
3 1 2

1 2 3 4 5
1 2 3 4 5 6 7
1 2 3

</p>