Given a grid where 0 = passable, 9 = goal, 1 = wall, find the shortest path from (0, 0) to the cell containing 9 using BFS. Return the distance, or -1 if unreachable.