CodeForces 699B One Bomb

题目链接：http://codeforces.com/problemset/problem/699/B

One Bomb

time limit per test ：1 second

memory limit per test ：256 megabytes

input ：standard input

output ：standard output

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

思路：将所有星号的位置存储起来，然后枚举位置，判断所有星号有没有不在这一行且不在这一列，有的话及时退出循环就可以了，没有的话就输出答案，停止枚举，最后判断是否输出答案了，没输出就输出无解的答案。

附上AC代码：

#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
const int maxn = 1005;
string str[maxn];
int n, m;
vector<pii > v;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	for (int i=0; i<n; ++i)
		cin >> str[i];
	for (int i=0; i<n; ++i)
		for (int j=0; j<m; ++j)
			if (str[i][j] == '*')
				v.push_back(make_pair(i, j));
	bool ok = false;
	for (int i=0; i<n&&!ok; ++i)
		for (int j=0; j<m&&!ok; ++j){
			int k;
			for (k=0; k<v.size(); ++k)
				if (v[k].first!=i && v[k].second!=j)
					break;
			if (k == v.size()){
				cout << "YES" << endl << i+1 << " " << j+1 << endl;
				ok = true;
			}
		}
	if (!ok)
		cout << "NO" << endl;
	return 0;
}