**Note: The only difference between this problem and [problem B1](https://www.facebook.com/codingcompetitions/hacker-cup/2022/qualification-round/problems/B1) is that here, scenes are larger and may contain rocks.**

Boss Rob painted a beautiful scene on a 2D canvas of \(R\) rows by \(C\) columns, containing zero or more happy little trees **and zero or more rocks.**

To make sure none of his trees are lonely, Rob would like you to add as many trees as you'd like (possibly \(0\)) to empty spaces so that each tree in the final painting has at least two tree *friends*, that is, two trees which are each adjacent to it (directly to its north, south, east, or west). If there are multiple solutions, you may print any one of them. 


# Constraints

\(1 \leq T \leq 80\)
\(1 \leq R, C \leq \mathbf{3{,}000}\)


# Input Format

Input begins with an integer \(T\), the number of test cases. For each case, there is first a line containing two space-separated integers, \(R\) and \(C\). Then, \(R\) lines follow, each of which contains \(C\) characters, either "`.`" (an empty space), "`^`" (a tree), **or "`#`" (a rock)**, representing the initial painting.


# Output Format

For the \(i\)th case, print "`Case #i:` ", followed by "`Possible`" and \(R\) lines of \(C\) characters each representing the final painting (if a solution exists), otherwise "`Impossible`".


# Sample Explanation

In the first case (depicted below), we could add two tree friends to either side of the middle tree, but they themselves would each only have one tree friend. Therefore, it's impossible to get two friends for each tree in the final painting.

{{PHOTO_ID:604840697695882|WIDTH:295}}

In the second case, there are no trees in the initial painting, so the condition of two friends for each tree is already satisfied.

In the third case, one possible solution is depicted below.

{{PHOTO_ID:749016109740997|WIDTH:700}}