Shortest increasing path to a target value in a grid

Given an integer grid, answer repeated queries. Each query names a target value; return the values along a shortest path from the top-left cell to a cell holding that value, where every step goes up, down, left or right to a strictly larger value. Return an empty path when the value is absent or can't be reached.

Because queries repeat, say what you would compute once and reuse.