#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 300005, M = N;
long long power(long long a, long long b) {
  if (b == 0) return 1;
  if (b == 1) return a;
  if (b % 2 == 1) return (power(a, b - 1) * a) % 998244353;
  long long q = power(a, b / 2);
  return (q * q) % 998244353;
}
int main() {
  bool ans = true;
  long long a, b, res = 0, cunt = 1;
  int h[1005], v[1005];
  string y[1005];
  vector<pair<int, int> > p;
  cin >> a >> b;
  for (int i = 0; i < 1005; ++i) {
    v[i] = 0;
    h[i] = 0;
  }
  for (int i = 0; i < a; ++i) {
    cin >> y[i];
    h[i] = count(y[i].begin(), y[i].end(), '*');
    for (int j = 0; j < b; ++j) {
      if (y[i][j] == '*') {
        v[j]++;
        res++;
      }
    }
  }
  for (int i = 0; i < a; ++i) {
    for (int j = 0; j < b; ++j) {
      if ((h[i] + v[j] - (y[i][j] == '*')) == res) {
        cout << "YES" << endl;
        cout << i + 1 << " " << j + 1;
        return 0;
      }
    }
  }
  cout << "NO";
}
