#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
char grid[N][N];
set<int> x;
set<int> y;
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> grid[i][j];
      if (grid[i][j] == '*') {
        if (binary_search(x.begin(), x.end(), i))
          x.erase(i);
        else
          x.insert(i);
        if (binary_search(y.begin(), y.end(), j))
          y.erase(j);
        else
          y.insert(j);
      }
    }
  }
  cout << *(x.begin()) + 1 << " " << *(y.begin()) + 1 << endl;
}
