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

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

一开始思路比较乱一点 想直接暴力 刚想开始干代码 看了一下范围 是 10^6 ，n*n是肯定炸的 

最后实在没有什么办法 想了一下 优化一下 优雅的暴力一下试试 希望不会卡复杂度 竟然 1遍就A了

题意：

给你一个充满空地和墙的地图，然后给你一个炸弹，炸弹引爆的时候会把放置炸弹的那一行和那一列全部炸为空地，然后问有没有可能把地图全都变为空地。可以的话输出“YES”并输出坐标，反之输出“NO”

题解：

把所有墙的位置存一下，然后遍历n*m，每个地方都放置一下试试，如果和所有墙都在同一列或者同一行，直接break就可以了。

#include <algorithm>
#include <iostream>
#include <numeric>
#include <cstring>
#include <iomanip>
#include <string>
#include <vector>
#include <cstdio>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const LL M = 100099;
const double esp = 1e-6;
const double PI = 3.14159265359;
const LL INF = 0x3f3f3f3f;
using namespace std;

struct node{
    int x,y;
}arr[1000005];
char str[1005][1005];
int main(){
    int n,m;
    while(~scanf("%d %d",&n,&m)){
        int top = 0;
        for(int i=1;i<=n;i++){
            scanf("%s",str[i]+1);
            for(int j=1;j<=m;j++){
                if(str[i][j] == '*'){
                    arr[top].x = i;
                    arr[top++].y = j;
                }
            }
        }
        bool fs = true;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                bool f = true;
                for(int k=0;k<top;k++){
                    if(!(arr[k].x == i || arr[k].y == j)){
                        f = false;
                        break;
                    }
                }
                if(f){
                    printf("YES\n%d %d\n",i,j);
                    fs = false;
                    break;
                }
            }
            if(!fs)
                break;
        }
        if(fs)
            printf("NO\n");
    }
    return 0;
}