Given an array nums of distinct integers, return all the possible permutations in lexicographic order.
Example 1:
Input: 1 2 3 Output: 1 2 3 1 3 2 2 1 3 2 3 1 3 1 2 3 2 1
Example 2:
Input: 0 1 Output: 0 1 1 0
Constraints:
- 1 ≤ nums.length ≤ 6
- -10 ≤ nums[i] ≤ 10
- All integers are distinct.
Input format: A single line of space-separated integers.
Output format: Each permutation on its own line, elements space-separated, in lexicographic order.