##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
CSES 1693 - Directed Euler path.
Problem: A game has levels with one-way teleporters. You start at level and want to reach level using each teleporter exactly once.
Link: CSES 1693
Constraints:
Output: A sequence of levels, or "IMPOSSIBLE" if no valid path exists.
Note: This is a directed Euler path problem, not a circuit.
