const int N = 1010, M = 1010;

struct pct
{
	int i,j;
};

int v[N][M],n,m;
int i1,j1,i2,j2;
int dragon[N*M],nr_dragoni;
pct coada[N*M];

void citire()
{
	scanf("%d%d",&n,&m);
	gets(s);
	for (int i = 1; i <= n; ++i)
	{
		gets(s);
		for (int j = 1; j <= m; ++j)
		{
			if (s[j-1] == ".")
				v[i][j] = 0;
			if (s[j-1] == "*")
				v[i][j] = -1;
			if (s[j-1] == "D")
			{
				v[i][j] = 0;
				coada[++q].i = i;
				coada[q].j = j;
			}
			if (s[j-1] == "I")
			{
				v[i][j] = 0;
				i1 = i;
				j1 = j;
			}
			if (s[j-1] == "O")
			{
				v[i][j] = 0;
				i2 = i;
				j2 = j;
			}
		}
	}
}

void calculare_distante_dragoni()
{
	
}

int main()
{
	freopen("barbar.in","r",stdin);
	freopen("barbar.out","w",stdout);
	citire();
	calculare_distante_dragoni();
	return 0;
}