B'You might have remembered Theatre square from the problem 1A. Now it 's finally getting repaved. The square still has a rectangular shape of n x m meters. However, the picture is about to get more complicated now. Let a_{i,j} be the j -th square in the i -th row of the pavement. You are given the picture of the squares: The black squares are paved already. You have to pave the white squares. There are two options for pavement tiles: You should cover all the white squares, no two tiles should overlap and no black squares should be covered by tiles. What is the smallest total price of the tiles needed to cover all the white squares? The first line contains a single integer t ( 1 <= t <= 500 ) -- the number of testcases. Then the description of t testcases follow. The first line of each testcase contains four integers n , m , x and y ( 1 <= n <= 100 ; 1 <= m <= 1000 ; 1 <= x, y <= 1000 ) -- the size of the Theatre square, the price of the 1 x 1 tile and the price of the 1 x 2 tile. Each of the next n lines contains m characters. The j -th character in the i -th line is a_{i,j} . If a_{i,j} = "*", then the j -th square in the i -th row should be black, and if a_{i,j} = ".", then the j -th square in the i -th row should be white. It 's guaranteed that the sum of n x m over all testcases doesn 't exceed 10^5 . For each testcase print a single integer -- the smallest total price of the tiles needed to cover all the white squares in burles. In the first testcase you are required to use a single 1 x 1 tile, even though 1 x 2 tile is cheaper. So the total price is 10 burles. In the second testcase you can either use two 1 x 1 tiles and spend 20 burles or use a single 1 x 2 tile and spend 1 burle. The second option is ch'...