K Highest Ranked Items Within a Price Range

Run a BFS from the start to get shortest-path distances to reachable cells (0 = wall), collect cells whose value is within [low, high], and return up to k positions sorted by increasing distance, then increasing price, then smaller row, then smaller column.