Question
Combine three nondecreasing integer lists into one nondecreasing list in which every distinct value appears once, then print it as a single space-separated line. ```python def solve(raw: str) -> str: ... ``` ## Requirements - The input has exactly three lines. Each line starts with a count `k` followed by `k` nondecreasing integers. - The merged result must stay sorted and must contain each distinct value exactly once. - Values may be negative, zero, or positive. Duplicates can appear within one line and across lines. - Print the distinct values in one line separated by single spaces, with no leading or trailing space. - If all three lists are empty, return an empty string. - `run_case(case: dict)` forwards `case["stdin"]` to `solve`. - Do not append a trailing newline to the returned string; return the value exactly once.