#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)((1e5) + 10);
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int max(int a, int b) {
  if (a > b)
    return a;
  else
    return b;
}
int min(int a, int b) {
  if (a < b)
    return a;
  else
    return b;
}
bool isPrime(int N) {
  for (int i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
int cbrt(int x) {
  int lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    int mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
bool compare(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  int n, m;
  cin >> n >> m;
  char a[n][m];
  vector<int> x;
  vector<int> y;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] == '*') {
        x.push_back(i + 1);
        y.push_back(j + 1);
      }
    }
  }
  sort(x.begin(), x.end());
  sort(y.begin(), y.end());
  if (x[0] == x[1])
    cout << x[2] << " ";
  else if (x[1] == x[2])
    cout << x[0] << " ";
  if (y[0] == y[1])
    cout << y[2] << "\n";
  else if (y[1] == y[2])
    cout << y[0] << "\n";
  return 0;
}
