#include <bits/stdc++.h>
using namespace std;
struct point {
  int x, y;
  point() {}
  point(int a, int b) {
    x = a;
    y = b;
  }
};
point p[10];
char s[110][110];
int fl[110][110];
bool comp(point p1, point p2) {
  if (p1.x == p2.x) return p1.y < p2.y;
  return p1.x < p2.x;
}
int main() {
  int i, j, k, l, test, t = 1;
  int n, m;
  scanf("%d %d", &n, &m);
  for (i = 1; i <= n; i++) {
    scanf("%s", s[i] + 1);
  }
  int tot = 0;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (s[i][j] == '*') {
        fl[i][j] = 1;
        p[tot++] = point(i, j);
      }
    }
  }
  sort(p, p + tot, comp);
  if (p[0].x == p[1].x) {
    if (p[2].y == p[0].y)
      printf("%d %d\n", p[2].x, p[1].y);
    else
      printf("%d %d\n", p[2].x, p[0].y);
  } else {
    if (p[1].y == p[0].y)
      printf("%d %d\n", p[0].x, p[2].y);
    else
      printf("%d %d\n", p[0].x, p[1].y);
  }
  return 0;
}
