#Water Flow

In this variation of the previous problem, raindrops can flow to any lower adjacent cell. Find the final destinations for all matrix cells. **Input:** 2 4 6 8 5 9 1 3 10 13 7 20 **Output:** 0 0 0,1 0,1 0 0,1 1 0,1 0 0,1 0,1 0,1

Given a matrix of distinct positive integers representing heights, find the final destination for raindrops on all cells. A raindrop flows to the lowest adjacent cell. **Input:** 2 4 6 8 5 9 1 3 10 13 7 20 **Output:** 0 0 0 0 0 1 1 0 0 0 0 0