Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets.

Example 1:

Input: 1 2 3
Output:

1
1 2
1 2 3
1 3
2
2 3
3

(The first line is the empty subset.)

Example 2:

Input: 0
Output:

0

Constraints:

• 1 ≤ nums.length ≤ 10
• -10 ≤ nums[i] ≤ 10
• All elements of nums are unique.

Input format: A single line of space-separated integers.

Output format: Each subset on its own line, elements space-separated and sorted ascending. Subsets in lexicographic order. The empty subset is an empty line.