Unique Word Combinations

Given a list of words, generate all possible unique combinations that can be formed by selecting each word exactly once. The order of the words in a combination does not matter, but the output should be sorted lexicographically. Each combination should be output on a new line. Input: The input consists of a single line containing a space-separated list of words. Output: The output should contain each unique combination of words, sorted lexicographically, each on a new line. Example: Input: apple banana cherry Output: apple banana cherry apple cherry banana banana apple cherry banana cherry apple cherry apple banana cherry banana apple