#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 10;
char ch[N];
int a[N][N];
int h[N], l[N];
int n, m;
int main() {
  cin >> n >> m;
  int tot = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%s", ch + 1);
    for (int j = 1; j <= m; j++) {
      a[i][j] = ch[j] == '*' ? 1 : 0;
      h[i] += a[i][j];
      l[j] += a[i][j];
      tot += a[i][j];
    }
  }
  int x = -1, y = -1;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      if (h[i] + l[j] - a[i][j] == tot) {
        x = i;
        y = j;
        break;
      }
  if (x == -1) {
    puts("NO");
  } else {
    puts("YES");
    cout << x << ' ' << y << endl;
  }
  return 0;
}
