Mani has locked Hamid in a (1 \times n) grid. Initially, some cells of the grid contain walls and the rest are empty, and Hamid is in an empty cell. In each day, the following events happen in order: Mani selects an empty cell and builds a wall in that cell. Note that he can not build a wall in the cell which Hamid currently is at; Hamid selects a direction (left or right), then If there are no walls in that direction, he will escape the grid; Otherwise, he will move to the nearest wall in that direction and destroy that wall. Hamid is at the position of the destroyed wall after this day. If there are no walls in that direction, he will escape the grid; Otherwise, he will move to the nearest wall in that direction and destroy that wall. Hamid is at the position of the destroyed wall after this day. Here is an example of a possible sequence of actions when (n=6): Hamid is always aware of where the walls are. He wants to minimize the number of days that he needs to escape the grid, while Mani wants to maximize it. You have to determine the number of days Hamid needs to escape the grid if they both act optimally. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains two integers (n) and (x) ((2 \leq n \leq 2 \cdot 10^5), (1 \leq x \leq n)) — the size of the grid and the initial position of Hamid. He is at the (x)-th cell from left to right initially. The second line contains a string (s) of length (n) ((s_i="#") or (".")) — the initial state of the grid. The (i)-th cell of the grid contains a wall if (s_i= "#"), and it is empty if (s_i="."). It is guaranteed that the (x)-th cell is empty, and there are at least two empty cells in the grid. It is guaranteed that the sum of (n) over all test cases does not excee