Challenge: Backward In-Place Merge

Start with the idea

Solve the exact task, not just the visible example: Merge the second sorted list into the first buffer. On input a=[1,3,7,0,0,0] m=3; b=[2,5,6], predict the output before opening the answer reveal. The revealed output is a test oracle for this case, while private checks exercise other legal cases. Start by stating the input grammar and output format in your own words. Parse the complete input, including surrounding whitespace, before relying on any convenient positions in the example.

Build the solution around one maintained claim: Fill free capacity from the end so unread source values are never overwritten. Decide what state represents that claim, how it is initialized, what a single update does, and when the algorithm stops. Two positions move according to a monotone fact: after one comparison, some candidates can be ruled out permanently. Name that fact. Trace the visible input by hand and record at least two intermediate states, not only the final answer. If the trace cannot justify your predicted output, there is a gap between the idea and the implementation.

Use the Rust sketch as a guide, not a substitute for a complete solve function. The supplied Rust sketch is a starting point. Identify what it stores, how one iteration changes it, and whether it already solves the exact task or only demonstrates a related operation. Use explicit bounds for both indices.