$n$ lines are given in the plane so that no three of them concur and no two are parallel. Show that there is a non-self-intersecting path consisting of $n$ straight segments so that each of the given lines contains exactly one of the segments of the path.
Problem
Source: 2022 Grosman Mathematical Olympiad P5
Tags: combinatorial geometry, combinatorics unsolved