B'Holidays are coming up really soon. Rick realized that it 's time to think about buying a traditional spruce tree. But Rick doesn 't want real trees to get hurt so he decided to find some in an n x m matrix consisting of "*" and ".". To find every spruce first let 's define what a spruce in the matrix is. A set of matrix cells is called a spruce of height k with origin at point (x, y) if: Examples of correct and incorrect spruce trees: Now Rick wants to know how many spruces his n x m matrix contains. Help Rick solve this problem. Each test contains one or more test cases. The first line contains the number of test cases t ( 1 <= t <= 10 ). The first line of each test case contains two integers n and m ( 1 <= n, m <= 500 ) -- matrix size. Next n lines of each test case contain m characters c_{i, j} -- matrix contents. It is guaranteed that c_{i, j} is either a "." or an "*". It is guaranteed that the sum of n cdot m over all test cases does not exceed 500^2 ( sum n cdot m <= 500^2 ). For each test case, print single integer -- the total number of spruces in the matrix. In the first test case the first spruce of height 2 has its origin at point (1, 2) , the second spruce of height 1 has its origin at point (1, 2) , the third spruce of height 1 has its origin at point (2, 1) , the fourth spruce of height 1 has its origin at point (2, 2) , the fifth spruce of height 1 has its origin at point (2, 3) . In the second test case the first spruce of height 1 has its origin at point (1, 2) , the second spruce of height 1 has its origin at point (2, 1) , the third spruce of height 1 has its origin at point (2, 2) . '...