#include <bits/stdc++.h>
using namespace std;
char Map[1111][1111];
int S[1111][1111];
int T[1111][1111];
int main() {
  int N, M;
  cin >> N >> M;
  int i, j;
  for (i = 1; i <= N; i++) {
    scanf("%s", &Map[i][1]);
  }
  int cnt = 0;
  for (i = 1; i <= N; i++)
    for (j = 1; j <= M; j++) {
      S[i][j] = S[i][j - 1];
      T[i][j] = T[i - 1][j];
      if (Map[i][j] == '*') {
        S[i][j]++;
        T[i][j]++;
        cnt++;
      }
    }
  int a = 0, b = 0, flag = 0;
  for (i = 1; i <= N; i++)
    for (j = 1; j <= M; j++) {
      if (Map[i][j] == '*') {
        int temp = S[i][M] + T[N][j];
        temp -= 1;
        if (temp == cnt) {
          flag = 1;
          a = i;
          b = j;
          break;
        }
      } else {
        int temp = S[i][M] + T[N][j];
        if (temp == cnt) {
          flag = 1;
          a = i;
          b = j;
          break;
        }
      }
    }
  if (flag) {
    printf("YES\n%d %d", a, b);
  } else
    printf("NO\n");
  return 0;
}
