hdu 4584 水题爽一发 *

 

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
#define MOD 1000000007
const int INF=0x3f3f3f3f;
const double eps=1e-5;
typedef long long ll;
#define cl(a) memset(a,0,sizeof(a))
#define ts printf("*****\n");
const int MAXN=2500;
char s[50][50];
int n,m,tt;
pair<int,int> p1[MAXN],p2[MAXN],ans1,ans2;
int dis(int i,int j)
{
    return (abs(p1[i].first-p2[j].first)+abs(p1[i].second-p2[j].second));
}
int main()
{
    int i,j,k;
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    #endif
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==0&&m==0)  break;
        int tot1=0,tot2=0;
        for(i=0;i<n;i++)
        {
            scanf("%s",s[i]);
            for(j=0;j<m;j++)
            {
                if(s[i][j]=='H')    p1[tot1++]=make_pair(i,j);
                if(s[i][j]=='C')    p2[tot2++]=make_pair(i,j);
            }
        }
        int Min=999999;
        for(i=0;i<tot1;i++)
        {
            for(j=0;j<tot2;j++)
            {
                if(dis(i,j)<Min)
                {
                    Min=dis(i,j);
                    ans1=p1[i];
                    ans2=p2[j];
                }
            }
        }
        printf("%d %d %d %d\n",ans1.first,ans1.second,ans2.first,ans2.second);
    }
}