Sequence Operations Transformation

You are given two integers x and y with constraints \(1 \le x, y \le 10^9\). The task is to determine the minimal number of operations required to transform x into y and to output a valid sequence of operations. In each operation, you can either add 1, denoted by '+' or subtract 1, denoted by '-' from the current number.

Formally, the number of operations required is \(|y - x|\). If \(x y\), a sequence of \(-\) operations. If \(x = y\), no operations are needed and the corresponding sequence is empty.

inputFormat

The first line of input contains an integer T denoting the number of test cases.

Each test case is described in one line containing two space-separated integers x and y. \(1 \le x, y \le 10^9\)

outputFormat

For each test case, output the minimal number of operations on one line, followed by the corresponding sequence of operations on the next line. The sequence should have each operation (either '+' or '-') separated by a space. If no operation is needed, output an empty line for the sequence.

## sample

1
5 8

3

</p>