Codeforces Round #363B (Div. 2) One Bomb

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.

Input

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.

Output

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.

Examples

input

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

output

YES
1 2

input

3 3
..*
.*.
*..

output

NO

input

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

output

YES
3 3

  本题的题意是给出一个图上面 *代表墙，.代表空地，用一个炸弹去炸墙，这个炸弹只能炸毁它所在的行和列的墙，问坐标中是否能放置一炸弹使所有的墙都给炸毁

能的话要给出炸弹坐标

  这题的做法是记录每行有多少个炸弹 每列有多少个炸弹 行列相加便是此行的炸弹（要考虑那行那列是不是个炸弹 是的话要减去1）

  然后遍历每个点 使他的行列炸弹数相加 如果和等于墙的总数那么就存在这个点

  如果坐标中没有墙 那么结果为 1 1

代码如下：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define N 1001

int main()
{
	char 	a[N][N];
	int x[N],y[N];
	int k,n,m,i,j,s,tot;
	cin>>n>>m;
	s=0;
	memset(x,0,sizeof(x));
	memset(y,0,sizeof(y));
	for(i=1;i<=n;i++)
	 for(j=1;j<=m;j++)
	{
		cin>>a[i][j];
		if(a[i][j]=='*') {
			x[i]++;
			y[j]++;
			s++;
		}
		
	}
	int flag=0;
	for(i=1;i<=n;i++)
	{
	  for(j=1;j<=m;j++)
	 {
	 
	 		if(a[i][j]=='.'&&x[i]+y[j]==s){
	 			flag=1;
	 			break;
			 }
			 else if(a[i][j]=='*'&&x[i]+y[j]-1==s){
			 	flag=1;
			 	break;
			 }
		
	 }
	 if(flag==1) break;
    }
	 if(flag==1)
	 {
	 cout<<"YES"<<endl;
	  cout<<i<<" "<<j<<endl;
     }
     else if(s==0)
     {
     	cout<<"YES"<<endl;
     	cout<<"1 1"<<endl;
	 }
     else 
     cout<<"NO"<<endl;
	return 0;
}