#include <set>

#include <map>

#include <stack>

#include <queue>

#include <cmath>

#include <vector>

#include <string>

#include <cstdio>

#include <cstring>

#include <cstdlib>

#include <iostream>

#include <algorithm>

#define MAX(a,b) ((a)>=(b)?(a):(b))

#define MIN(a,b) ((a)<=(b)?(a):(b))

#define OO 0x0fffffff

typedef long long LL;

using namespace std;

const int N = ;

const int skip[][] = { { ,  }, { -,  }, { ,  }, { , - } };

int m, n, t;

int sx, sy, ex, ey;

char maze[N][N];

bool vis[N][N];

bool judge(int x, int y){

    if (x< || y< || x >= m || y >= n) return false;

    if (vis[x][y]) return false;

    if (maze[x][y] == 'X') return false;

    return true;

}

bool dfs(int x, int y, int step){

    if (x == ex&&y == ey&&step == t) return true;

    int tag = t - step - abs(ex-x) - abs(ey-y);

    if(tag<||tag&) return false;

    for (int i = ; i<; i++){

        int tx = x + skip[i][];

        int ty = y + skip[i][];

        if (judge(tx, ty)){

            vis[tx][ty] = true;

            if (dfs(tx, ty, step + )) return true;

            vis[tx][ty] = false;

        }

    }

    return false;

}

int main(){

    while (scanf("%d%d%d", &m, &n, &t), m + n + t){

        for (int i = ; i<m; i++) {

            scanf("%s", maze[i]);

            for (int j = ; j<n; j++){

                if (maze[i][j] == 'D') sx = i, sy = j;

                if (maze[i][j] == 'S') ex = i, ey = j;

            }

        }

        memset(vis, false, sizeof(vis));

        if (dfs(sx,sy,)) puts("YES");

        else puts("NO");

    }

    return ;

}