Making Zero

Consider the sequence 1 2 3 ... N, the integers from $1$ to $N$ written in ascending order.

Between every pair of adjacent numbers, insert exactly one of the following:

• + : addition
• - : subtraction
• (a space) : concatenate the two numbers into a single number

Evaluate the resulting expression. We want to find every case whose value equals $0$.

Given an integer $N$, write a program that prints every expression whose value is $0$.

The first line contains the number of test cases $T$ ($T < 10$).

Each of the following lines contains one natural number $N$ ($3 \le N \le 9$).

For each test case, print every expression whose value is $0$, one per line, in ASCII (lexicographic) order. The ASCII order of the operator characters is space ( ), then +, then -.

Separate the outputs of different test cases with a single blank line. Do not print a blank line after the last test case.