There is an infinite grid of cells. You need to find the shortest path from `start_cell` to `end_cell`. At one step you can move to any of 4 neighbor cells that share a side with the current cell.

Some of the cells are marked as `bombs`. You cannot step at those cells.

Find out the shortest path from `start_cell` to `end_cell`