#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
char c[MAXN][MAXN];
int N, M, cnt = 0;
pair<int, int> findOne() {
  for (int i = 0; i < N; ++i)
    for (int j = 0; j < M; ++j)
      if (c[i][j] == '*') return make_pair(i, j);
  return make_pair(-1, -1);
}
bool ok(int x, int y) {
  int t = 0;
  for (int i = 0; i < N; ++i) t += (c[i][y] == '*');
  for (int j = 0; j < M; ++j) t += (c[x][j] == '*');
  t -= (c[x][y] == '*');
  return t == cnt;
}
int main() {
  scanf("%d%d", &N, &M);
  for (int i = 0; i < N; ++i) {
    scanf(" %s", c[i]);
    for (int j = 0; j < M; ++j) cnt += (c[i][j] == '*');
  }
  pair<int, int> p = findOne();
  if (p.first < 0) {
    printf("YES\n1 1\n");
    return 0;
  } else {
    for (int i = 0; i < N; ++i)
      if (ok(i, p.second)) {
        printf("YES\n%d %d\n", i + 1, p.second + 1);
        return 0;
      }
    for (int j = 0; j < M; ++j)
      if (ok(p.first, j)) {
        printf("YES\n%d %d\n", p.first + 1, j + 1);
        return 0;
      }
  }
  printf("NO\n");
  return 0;
}
