#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979;
const double PI = 4.0 * atan(1);
struct point {
  float x, y;
};
bool check(int n, vector<long long int> arr) {
  for (int i = 0; i < n - 1; i++) {
    if (arr[i] > arr[i + 1]) return 0;
  }
  return 1;
}
struct PT {
  double x, y;
  PT() {}
  PT(double x, double y) : x(x), y(y) {}
  PT(const PT &p) : x(p.x), y(p.y) {}
  PT operator+(const PT &p) const { return PT(x + p.x, y + p.y); }
  PT operator-(const PT &p) const { return PT(x - p.x, y - p.y); }
  PT operator*(double c) const { return PT(x * c, y * c); }
  PT operator/(double c) const { return PT(x / c, y / c); }
};
long long int gcd(long long int a, long long int b) {
  for (;;) {
    if (a == 0) return b;
    b %= a;
    if (b == 0) return a;
    a %= b;
  }
}
long long int lcm(long long int a, long long int b) {
  long long int temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
double dist(PT a, PT b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
long long int choose(int n, int k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
int MAX = 500;
int multi(int x, int res[], int res_size) {
  int carry = 0;
  for (int i = 0; i < res_size; i++) {
    int prod = res[i] * x + carry;
    res[i] = prod % 10;
    carry = prod / 10;
  }
  while (carry) {
    res[res_size] = carry % 10;
    carry = carry / 10;
    res_size++;
  }
  return res_size;
}
void fact(int n) {
  int res[MAX];
  res[0] = 1;
  int res_size = 1;
  for (int x = 2; x <= n; x++) res_size = multi(x, res, res_size);
  for (int i = res_size - 1; i >= 0; i--) cout << res[i];
}
long double delta(int a, int b, int c) { return b * b - 4 * a * c; }
unsigned long long int mul_mod(unsigned long long int a,
                               unsigned long long int b,
                               unsigned long long int m) {
  long double x;
  unsigned long long int c;
  long long int r;
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  x = a;
  c = x * b / m;
  r = (long long int)(a * b - c * m) % (long long int)m;
  return r < 0 ? r + m : r;
}
bool visited[20][20];
int wss, bs;
int curs;
int n;
bool comp(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
bool comp1(int val, pair<int, int> a) { return val <= a.first; }
struct tree {
  int value;
  tree *tright = NULL, *tleft = NULL;
};
double dot(PT p, PT q) { return p.x * q.x + p.y * q.y; }
vector<PT> CircleLineIntersection(PT a, PT b, PT c, double r) {
  vector<PT> ret;
}
char grid[1005][1005];
int val[105];
int dp[105][2];
int main() {
  int n, m;
  cin >> n >> m;
  pair<int, int> center, center2;
  center.first = -1;
  center.second = -1;
  center2 = center;
  bool lt = 0, no = 0, ans1 = 1, ans2 = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> grid[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (grid[i][j] == '*') {
        if (center.first == -1) {
          center = make_pair(i, j);
        } else {
          if (i != center.first && j != center.second) {
            if (!lt) {
              center2 = make_pair(center.first, j);
              center = make_pair(i, center.second);
              lt = 1;
              break;
            }
          }
        }
      }
    }
    if (lt) break;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (grid[i][j] == '*' && (i != center.first && j != center.second))
        ans1 = 0;
      if (grid[i][j] == '*' && (i != center2.first && j != center2.second))
        ans2 = 0;
    }
  }
  no = !ans1 && !ans2;
  if (no) {
    cout << "NO";
  } else {
    if (ans1) {
      if (center.first == -1) {
        cout << "YES\n" << center.first + 2 << ' ' << center.second + 2;
      } else {
        cout << "YES\n" << center.first + 1 << ' ' << center.second + 1;
      }
    } else {
      cout << "YES\n" << center2.first + 1 << ' ' << center2.second + 1;
    }
  }
  return 0;
}

### Prompt

In CPP, your task is to solve the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979;
const double PI = 4.0 * atan(1);
struct point {
  float x, y;
};
bool check(int n, vector<long long int> arr) {
  for (int i = 0; i < n - 1; i++) {
    if (arr[i] > arr[i + 1]) return 0;
  }
  return 1;
}
struct PT {
  double x, y;
  PT() {}
  PT(double x, double y) : x(x), y(y) {}
  PT(const PT &p) : x(p.x), y(p.y) {}
  PT operator+(const PT &p) const { return PT(x + p.x, y + p.y); }
  PT operator-(const PT &p) const { return PT(x - p.x, y - p.y); }
  PT operator*(double c) const { return PT(x * c, y * c); }
  PT operator/(double c) const { return PT(x / c, y / c); }
};
long long int gcd(long long int a, long long int b) {
  for (;;) {
    if (a == 0) return b;
    b %= a;
    if (b == 0) return a;
    a %= b;
  }
}
long long int lcm(long long int a, long long int b) {
  long long int temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
double dist(PT a, PT b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
long long int choose(int n, int k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
int MAX = 500;
int multi(int x, int res[], int res_size) {
  int carry = 0;
  for (int i = 0; i < res_size; i++) {
    int prod = res[i] * x + carry;
    res[i] = prod % 10;
    carry = prod / 10;
  }
  while (carry) {
    res[res_size] = carry % 10;
    carry = carry / 10;
    res_size++;
  }
  return res_size;
}
void fact(int n) {
  int res[MAX];
  res[0] = 1;
  int res_size = 1;
  for (int x = 2; x <= n; x++) res_size = multi(x, res, res_size);
  for (int i = res_size - 1; i >= 0; i--) cout << res[i];
}
long double delta(int a, int b, int c) { return b * b - 4 * a * c; }
unsigned long long int mul_mod(unsigned long long int a,
                               unsigned long long int b,
                               unsigned long long int m) {
  long double x;
  unsigned long long int c;
  long long int r;
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  x = a;
  c = x * b / m;
  r = (long long int)(a * b - c * m) % (long long int)m;
  return r < 0 ? r + m : r;
}
bool visited[20][20];
int wss, bs;
int curs;
int n;
bool comp(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
bool comp1(int val, pair<int, int> a) { return val <= a.first; }
struct tree {
  int value;
  tree *tright = NULL, *tleft = NULL;
};
double dot(PT p, PT q) { return p.x * q.x + p.y * q.y; }
vector<PT> CircleLineIntersection(PT a, PT b, PT c, double r) {
  vector<PT> ret;
}
char grid[1005][1005];
int val[105];
int dp[105][2];
int main() {
  int n, m;
  cin >> n >> m;
  pair<int, int> center, center2;
  center.first = -1;
  center.second = -1;
  center2 = center;
  bool lt = 0, no = 0, ans1 = 1, ans2 = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> grid[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (grid[i][j] == '*') {
        if (center.first == -1) {
          center = make_pair(i, j);
        } else {
          if (i != center.first && j != center.second) {
            if (!lt) {
              center2 = make_pair(center.first, j);
              center = make_pair(i, center.second);
              lt = 1;
              break;
            }
          }
        }
      }
    }
    if (lt) break;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (grid[i][j] == '*' && (i != center.first && j != center.second))
        ans1 = 0;
      if (grid[i][j] == '*' && (i != center2.first && j != center2.second))
        ans2 = 0;
    }
  }
  no = !ans1 && !ans2;
  if (no) {
    cout << "NO";
  } else {
    if (ans1) {
      if (center.first == -1) {
        cout << "YES\n" << center.first + 2 << ' ' << center.second + 2;
      } else {
        cout << "YES\n" << center.first + 1 << ' ' << center.second + 1;
      }
    } else {
      cout << "YES\n" << center2.first + 1 << ' ' << center2.second + 1;
    }
  }
  return 0;
}

```