The runway passes by \(n\) trees (the first tree is at position \(0\)) and the finish line is at position \(L\). There are \(m\) freshmen joining in the race. Before the relay race starts, each of the racer should be assigned to the place of one of the trees, and there should not be two racers being assigned to the same tree. What's more, the first racer should be assigned to the place of the first tree. Then, the race starts, and every racer runs ahead to the next racer.
Since CC is strong, she runs the longest distance among the freshmen (so the distance every racer runs should be less than or equal to CC's distance). Given the positions of the trees, do you know what is the minimum distance CC may run?