#include <bits/stdc++.h>
using namespace std;
map<long long, bool> visi;
vector<long long> v;
int ar[1000001];
int vis[1000001];
int xx[10001];
int yy[1001][1001];
int r;
char str[1009][1009];
int n, m, sum, lol;
int main() {
  int i, j, a, c, b, ck, t, x, y, ans, rem, k, cnt, mid, lo, hi, key, cs = 1;
  char ch;
  scanf("%d%d", &n, &m);
  a = cnt = 0;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      scanf(" %c", &str[i][j]);
      if (str[i][j] == '*') {
        yy[i][j] = yy[i - 1][j] + 1;
        cnt++;
        a++;
      } else
        yy[i][j] = yy[i - 1][j];
    }
    xx[i] = a;
    a = 0;
  }
  ck = 0;
  if (cnt == 0)
    printf("YES\n1 1\n");
  else {
    for (i = 1; i <= n; i++) {
      for (j = 1; j <= m; j++) {
        sum = xx[i] + yy[n][j];
        if (str[i][j] == '*') sum = sum - 1;
        if (sum == cnt) {
          printf("YES\n%d %d\n", i, j);
          ck = 1;
          break;
        }
      }
      if (ck == 1) break;
    }
    if (ck == 0) printf("NO\n");
  }
}
