You can travel from intersection 0 to intersection n - 1 in the shortest amount of time in `dp[n - 1] % MOD` ways.

Solve circular array queries: find min distance between query index and same value in array. Use hashmap to store indices, binary search for efficient lookup.