K Highest Ranked Items Within A Price Range

A shop floor is described by an m x n integer grid:

• 0 is a wall that cannot be entered;
• 1 is an empty walkway cell;
• any value greater than 1 is a cell holding an item with that price (you can also walk through it).

Moving to an adjacent cell (up, down, left, right) takes one step. You start at start = [row, col], which is never a wall. You are interested in items whose price lies in the inclusive range pricing = [low, high].

Rank every reachable item in range using these keys, in order:

1. shorter shortest-path distance from start ranks higher;
2. then lower price;
3. then smaller row index;
4. then smaller column index.

Return the positions [row, col] of the k highest-ranked items, best first. If fewer than k items qualify, return all of them in rank order (an empty list if none). The start cell itself counts, with distance 0, if it holds an in-range item.