#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e6 + 10, INF = 5e3 + 1, mod = 998244353;
long long n, m, o, ans, cl, d, a[MAX], b[MAX], sum, sum2,
    sum3 = 0, x, mx = -1, mn = INF, best = INF, k, y, z, R, dp;
string s, str;
vector<int64_t> adj[MAX];
bool mark[MAX], mark2[MAX];
queue<int64_t> q;
int32_t main() {
  cin >> n >> m;
  for (int64_t i = 0; i < n; i++) {
    cin >> s;
    for (int64_t j = 0; j < s.size(); j++) {
      if (s[j] == '*') {
        a[i]++;
        b[j]++;
      }
    }
  }
  for (int64_t i = 0; i < 110; i++) {
    if (a[i] == 1) {
      cout << i + 1 << ' ';
      break;
    }
  }
  for (int64_t i = 0; i < 110; i++) {
    if (b[i] == 1) {
      cout << i + 1 << ' ';
      break;
    }
  }
}
