#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;

char Map[8][8];
int Used[8][8];
int Dir[4][2]={{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
int H, W, T, Done;
int Sx, Sy, Ex, Ey;

int DFS(int h, int w, int Step)
{
    int k;
    if(Done==1) return 0;
    if(Step==T)
    {
        if(h==Ex && w==Ey) Done=1;
        return 0;
    }

    if(Step > T) return 0; //剪枝1

    if(abs(Ex-h)+abs(Ey-w) > T-Step) return 0; //剪枝2

    if((abs(Ex-h)+abs(Ey-w))%2 != (T-Step)%2) return 0; //剪枝3  這個就是奇偶性剪枝了，相當牛B

    for(k=0; k<4; k++)
    {
        int tx = h+Dir[k][0];
        int ty = w+Dir[k][1];
        if(tx>=0 && tx<H && ty>=0 && ty<W && Used[tx][ty]==0 && Map[tx][ty]!='X')
        {
            Used[tx][ty] = 1;
            DFS(tx, ty, Step+1);
            Used[tx][ty] = 0;
        }
    }
}

int main()
{
    int i, j;
    while(cin>>H>>W>>T && (H+W+T))
    {
        for(i=0; i<H; i++)
            for(j=0; j<W; j++)
            {
                cin>>Map[i][j];
                if(Map[i][j]=='S')
                {
                    Sx = i;
                    Sy = j;
                }
                if(Map[i][j]=='D')
                {
                    Ex = i;
                    Ey = j;
                }
            }
        Done = 0;
        memset(Used, 0, sizeof(Used));
        Used[Sx][Sy] = 1;
        DFS(Sx, Sy, 0);
        if(Done==1) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;

    }
}