#include <bits/stdc++.h>
using namespace std;
int N, M;
int ar[1005][1005];
string s;
int colsum[1005];
int rowsum[1005];
int main(void) {
  memset(colsum, 0, sizeof(colsum));
  memset(rowsum, 0, sizeof(rowsum));
  int cnt = 0;
  cin >> N >> M;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) {
      char c;
      cin >> c;
      if (c == '.')
        ar[i][j] = 0;
      else {
        ar[i][j] = 1;
        cnt++;
      }
    }
  }
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) {
      colsum[i] += ar[i][j];
    }
  }
  for (int i = 0; i < M; i++) {
    for (int j = 0; j < N; j++) {
      rowsum[i] += ar[j][i];
    }
  }
  int f = 0;
  pair<int, int> ans;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) {
      if ((colsum[i] + rowsum[j] - ar[i][j]) == cnt) {
        ans.first = i;
        ans.second = j;
        f = 1;
      }
    }
  }
  if (f == 0)
    printf("NO\n");
  else {
    printf("YES\n");
    printf("%d %d\n", ans.first + 1, ans.second + 1);
  }
}
