#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long pn = 1000001;
bool prime[1000002];
void seive() {
  memset(prime, true, sizeof(prime));
  for (long long i = 2; i * i <= pn; i++) {
    if (prime[i]) {
      for (long long j = i * i; j <= pn; j += i) prime[j] = false;
    }
  }
}
void solve(long long n, long long m) {
  char a[n][m];
  vector<pair<long long, long long> > v;
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m; j++) {
      cin >> a[i][j];
      if (a[i][j] == '*') v.push_back({i, j});
    }
  if (v[0].first == v[1].first) {
    if (v[0].second == v[2].second)
      cout << v[2].first + 1 << " " << v[1].second + 1;
    else
      cout << v[2].first + 1 << " " << v[0].second + 1;
    return;
  }
  if (v[1].first == v[2].first) {
    if (v[0].second == v[2].second)
      cout << v[0].first + 1 << " " << v[1].second + 1;
    else
      cout << v[0].first + 1 << " " << v[2].second + 1;
    return;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n, m;
  cin >> n >> m;
  solve(n, m);
}
