hdu 1010

#include<iostream>     //   ac
#include<cmath>
#include<cstdio>
using namespace std;
#define MAX 100

int sx,sy,dx,dy,N,M,T,p;
char a[MAX][MAX];
int b[4][2]={0,1,0,-1,1,0,-1,0};

void wenxin(int x,int y,int t)
{
    int i,j;
    if(p==1) return ;
    else if(t==0)
    {
       if(x==dx&&y==dy)  { p=1;return ; }
       else return;
    }
    else if ( t<abs(dx-x)+abs(dy-y)  || ( int( t-abs(dx-x)+abs(dy-y) ) )%2 )
         return ;
    else
    for(i=0;i<4;i++)
    {
        int nx=x+b[i][0],ny=y+b[i][1];
        if(nx>=0&&nx<N&&ny>=0&&ny<M&&(a[nx][ny]=='.'||a[nx][ny]=='D'))
        {
            a[nx][ny]='X';     
            wenxin(nx,ny,t-1);
            a[nx][ny]='.';   // 回溯

        }
    }

    return ;
}
/*
if(x+1<N&&a[x+1][y]!='X')
 wenxin(x+1,y,t-1);
if(x-1>=0&&a[x-1][y]!='X')
    wenxin(x-1,y,t-1);
if(y-1>=0&&a[x][y-1]!='X')
    wenxin(x,y-1,t-1);
if(y+1<M&&a[x][y+1]!='X')
    wenxin(x,y+1,'X');
*/
int main()
{
    int i,j;

    while(scanf("%d%d%d",&N,&M,&T),N||M||T)
    {
        for(i=0;i<N;i++)
          scanf("%s",a[i]);

        for(i=0;i<N;i++)
            for(j=0;j<M;j++)
           {
               if(a[i][j]=='S')
               { sx=i;sy=j;  }

               else if(a[i][j]=='D')
               {  dx=i;dy=j; }
           }
        p=0;
        wenxin(sx,sy,T);

       if(p)
             printf("YES\n");
       else  printf("NO\n");
    }
    return 0;
}