#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-10;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const long double PI = 3.1415926535897932384626433832795028841;
map<string, int> ssol;
void checkAdd(string vs) {
  if (ssol.find(vs) != ssol.end()) {
    return;
  }
  ssol[vs] = 1;
}
bool TST = 0;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= MOD;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
  }
  return res;
}
void Show(int *QQ, int N) {
  if (not TST) {
    return;
  }
  for (int x = 0; x < N; x++) {
    cout << QQ[x];
    if (x != N - 1) {
      cout << ',';
    }
  }
  cout << '\n';
}
void ShowLL(long long *QQ, int N) {
  if (not TST) {
    return;
  }
  for (int x = 0; x < N; x++) {
    cout << QQ[x];
    if (x != N - 1) {
      cout << ',';
    }
  }
  cout << '\n';
}
const int maxn = 100005;
const int maxm = 100005;
const int maxk = 100005;
char M[1005][1005];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  queue<pair<int, int> > Q1;
  queue<pair<int, int> > Q2;
  Q1.push(pair<int, int>(-1, -1));
  for (int i = 0; i < n; i++) {
    scanf("%s", M[i]);
    for (int j = 0; j < m; j++) {
      if (M[i][j] == '*') {
        while (not Q1.empty()) {
          pair<int, int> a = Q1.front();
          Q1.pop();
          if (a.first == -1) Q2.push(pair<int, int>(i, a.second));
          if (a.second == -1) Q2.push(pair<int, int>(a.first, j));
          if (a.first == i) Q2.push(a);
          if (a.second == j) Q2.push(a);
        }
        Q1 = Q2;
        while (not Q2.empty()) Q2.pop();
      }
    }
  }
  if (not Q1.empty()) {
    pair<int, int> a = Q1.front();
    cout << "YES\n";
    if (a.first == -1) a.first++;
    if (a.second == -1) a.second++;
    cout << a.first + 1 << ' ' << a.second + 1 << '\n';
    return 0;
  }
  cout << "NO\n";
}
