One Bomb

你接到了一个拆除工作： 有一个 $n*m$ 个单元格的仓库，其中每个格子只可能是"."或"*"。 "."表示该格子为空，"*"表示这里有一面墙。 现在你有一枚炸弹，可以爆破所有同行或同列的墙(它既可以放在墙内，也可以放在空单元格) 请你找出一种放置炸弹的方式，使得所有的墙都能被清除。 ## 输入格式： 第一行，两个整数$n$，$m$ $(1<=n,m<=1000)$ 接下来是一个$n*m$的矩阵，表示仓库的分布图。 ## 输出格式： 如果一颗炸弹就可以清除所有的墙，就输出"YES"（没有引号）,并在下一行输出x和y，表示炸弹放置的位置。 否则输出"NO"（同样没有引号） 如果存在多于一种方案，则输出其中一种即可。

You are given a description of a depot. It is a rectangular checkered field of $ n×m $ size. Each cell in a field can be empty (".") or it can be occupied by a wall ("\*"). You have one bomb. If you lay the bomb at the cell $ (x,y) $ , then after triggering it will wipe out all walls in the row $ x $ and all walls in the column $ y $ . You are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.

The first line contains two positive integers $ n $ and $ m $ ( $ 1<=n,m<=1000 $ ) — the number of rows and columns in the depot field. The next $ n $ lines contain $ m $ symbols "." and "\*" each — the description of the field. $ j $ -th symbol in $ i $ -th of them stands for cell $ (i,j) $ . If the symbol is equal to ".", then the corresponding cell is empty, otherwise it equals "\*" and the corresponding cell is occupied by a wall.

If it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print "NO" in the first line (without quotes). Otherwise print "YES" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.

3 4
.*..
....
.*..

YES
1 2

3 3
..*
.*.
*..

NO

6 5
..*..
..*..
*****
..*..
..*..
..*..

YES
3 3