#include <bits/stdc++.h>
using namespace std;
const int N = 109;
char M[N][N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf(" %s", M[i] + 1);
  pair<int, int> p[3];
  int top = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      if (M[i][j] == '*') {
        p[top].first = i;
        p[top++].second = j;
      }
  int x, y;
  for (int i = 0; i < top; ++i) {
    int findx = -1, findy = -1;
    for (int j = 0; j < top; ++j) {
      if (j != i) {
        if (p[i].first == p[j].first) findx = 0;
        if (p[i].second == p[j].second) findy = 0;
      }
    }
    if (findx == -1) x = p[i].first;
    if (findy == -1) y = p[i].second;
  }
  printf("%d %d\n", x, y);
  return 0;
}
