Leetcode 1409. Queries on a Permutation With Key

Start with P = [1..m]; for each query value, report its current 0-based index in P and then move that value to the front, returning the list of reported positions. The core challenge is maintaining a dynamic ordering under move-to-front operations so you can efficiently find each element's current position.