#include <bits/stdc++.h>
int main() {
  int n, m, t[3], u[3], i, j, count = 0, reqx, reqy, k;
  char c, a[102][102];
  scanf("%d %d", &n, &m);
  c = getchar();
  for (i = 0; i < n; i++) {
    for (j = 0; j <= m; j++) {
      c = getchar();
      if (c == '\n') {
        break;
      }
      a[i][j] = c;
      if (c == '*') {
        t[count] = i;
        u[count] = j;
        count++;
      }
    }
  }
  for (i = 0; i < 2; i++) {
    for (j = i + 1; j < 3; j++) {
      if (t[i] == t[j]) {
        k = 0;
        if (k != i && k != j) {
          if (u[k] == u[j]) {
            reqx = t[k];
            reqy = u[i];
            goto end;
          } else {
            reqx = t[k];
            reqy = u[j];
            goto end;
          }
        }
        k = 1;
        if (k != i && k != j) {
          if (u[k] == u[j]) {
            reqx = t[k];
            reqy = u[i];
            goto end;
          } else {
            reqx = t[k];
            reqy = u[j];
            goto end;
          }
        }
        k = 2;
        if (k != i && k != j) {
          if (u[k] == u[j]) {
            reqx = t[k];
            reqy = u[i];
            goto end;
          } else {
            reqx = t[k];
            reqy = u[j];
            goto end;
          }
        }
      }
    }
  }
end:
  printf("%d %d", reqx + 1, reqy + 1);
  return (0);
}
