#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>

const int inf = (1<<31)-1;
const int MAXN = 1e1;
using namespace std;

char G[MAXN][MAXN];
int n,m,tt,flag;
int mov[4][2]={-1,0,1,0,0,1,0,-1};

int check(int x,int y){
    if(x<1||y<1||x>n||y>m)return 0;
    if(G[x][y]==‘X‘)return 0;
    else return 1;
}

void dfs(int x,int y,int t){
    if(flag)return;//继续剪枝
    if(t>tt)return;
    if(G[x][y]==‘D‘){
        if(tt==t)
            flag = 1;
       // cout<<"ok"<<endl;
    }
    int nx,ny;
    if(G[x][y]==‘.‘){
        for(int i=0;i<4;i++){
            nx = x+mov[i][0];
            ny = y+mov[i][1];
            if(check(nx,ny)){
                G[x][y] = ‘X‘;
                dfs(nx,ny,t+1);
                G[x][y] = ‘.‘;
            }
        }
    }
}

int main()
{
    while(scanf("%d%d%d",&n,&m,&tt),n){
        flag = 0;
        int sx,sy,dx,dy;
        for(int i=1;i<=n;i++){
            scanf("%s",G[i]);
            for(int j=m;j>=1;j--){
                G[i][j] = G[i][j-1];
                if(G[i][j]==‘S‘){
                    sx = i;
                    sy = j;
                }else if(G[i][j]==‘D‘){
                    dx = i;
                    dy = j;
                }
            }
        }
        int tp  = fabs((sx-dx)*1.)+fabs((sy-dy)*1.);
        if(tp%2==tt%2&&tp<=tt){ //剪枝
            G[sx][sy]=‘.‘;
            dfs(sx,sy,0);
        }
        G[sx][sy]=‘.‘;
        dfs(sx,sy,0);
        if(flag)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}