#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long x) {
  return (x % 1000000007 + 1000000007) % 1000000007;
}
inline long long add(long long a, long long b) { return mod(mod(a) + mod(b)); }
inline long long sub(long long a, long long b) {
  return mod(mod(a) - mod(b) + 1000000007);
}
inline long long mul(long long a, long long b) { return mod(mod(a) * mod(b)); }
inline long long power(long long a, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = mul(r, a);
    a = mul(a, a);
    p >>= 1;
  }
  return r;
}
inline long long modInv(long long a) { return power(a, 1000000007 - 2); }
inline long long divi(long long a, long long b) { return mul(a, modInv(b)); }
inline long long fact(long long a) {
  long long r = 1;
  while (a) {
    r = mul(r, a);
    a--;
  }
  return r;
}
inline long long ncr(long long n, long long r) {
  return mul(mul(fact(n), modInv(fact(n - r))), modInv(fact(r)));
}
inline long long gcd(long long a, long long b) {
  return b == 0 ? a : gcd(b, a % b);
}
void c_p_c() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void solve() {
  long long n, m;
  cin >> n >> m;
  long long x = 0, y = 0;
  long long arr[n][m];
  char ch;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      cin >> ch;
      if (ch == '*') {
        arr[i][j] = 1;
      } else {
        arr[i][j] = 0;
      }
    }
  }
  long long ctR = 0, ctC = 0;
  for (long long i = 0; i < n; i++) {
    ctR = 0;
    for (long long j = 0; j < m; j++) {
      if (arr[i][j] == 1) {
        ctR++;
      }
    }
    if (ctR == 1) {
      x = i + 1;
      break;
    }
  }
  for (long long i = 0; i < m; i++) {
    ctC = 0;
    for (long long j = 0; j < n; j++) {
      if (arr[j][i] == 1) ctC++;
    }
    if (ctC == 1) {
      y = i + 1;
      break;
    }
  }
  cout << x << " " << y << endl;
}
int32_t main() {
  c_p_c();
  solve();
  return 0;
}
