#include <bits/stdc++.h>
using namespace std;
char arr[1002][1002];
long long temp[1002][1002], b[1002][1002], c[1002][1002], d[1002][1002],
    e[1002][1002];
int main() {
  long long n, m;
  long long req = 0;
  cin >> n >> m;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      cin >> arr[i][j];
      if (arr[i][j] == '*') {
        temp[i][j] = b[i][j] = c[i][j] = d[i][j] = e[i][j] = 1;
        req++;
      } else
        temp[i][j] = b[i][j] = c[i][j] = d[i][j] = e[i][j] = 0;
    }
  for (int i = 1; i <= n; i++) {
    for (int j = m - 1; j > 0; j--) b[i][j] += b[i][j + 1];
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1 + 1; j <= m; j++) {
      c[i][j] += c[i][j - 1];
    }
  for (int j = 1; j <= m; j++)
    for (int i = 1 + 1; i <= n; i++) d[i][j] += d[i - 1][j];
  for (int j = 1; j <= m; j++)
    for (int i = n - 1; i > 0; i--) e[i][j] += e[i + 1][j];
  long long ai = -1, aj;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      if (b[i][j + 1] + c[i][j - 1] + d[i - 1][j] + e[i + 1][j] + temp[i][j] ==
          req) {
        ai = i;
        aj = j;
        break;
      }
  if (ai == -1)
    cout << "NO";
  else
    cout << "YES\n" << ai << " " << aj;
  return 0;
}
