#include #include using namespace std; const int kMAX_H = 60; const int kMAX_W = 60; int H, W, A, Si, Sj, B, Gi, Gj; string M[kMAX_H]; int dp[kMAX_H][kMAX_W][kMAX_H * kMAX_W]; bool used[kMAX_H][kMAX_W][kMAX_H * kMAX_H]; int dr[4] = {1, 0, -1, 0}, dc[4] = {0, 1, 0, -1}; bool CanReach(int row, int col, int snow) { // cout << row << " " << col << " " << snow << endl; if (dp[row][col][snow] >= 0) { return dp[row][col][snow]; } used[row][col][snow] = true; bool result = (row == Gi && col == Gj && snow == B); for (int i = 0; i < 4; i++) { int nrow = row + dr[i], ncol = col + dc[i], nsnow; if (0 <= nrow && nrow < H && 0 <= ncol && ncol < W) { nsnow = snow + (M[nrow][ncol] == '*' ? 1 : -1); if (nsnow <= 0 || nsnow >= kMAX_H * kMAX_W || used[nrow][ncol][nsnow]) continue; result = result || CanReach(nrow, ncol, nsnow); } } used[row][col][snow] = false; return dp[row][col][snow] = result; } int main() { cin >> H >> W >> A >> Si >> Sj >> B >> Gi >> Gj; for (int i = 0; i < H; i++) { cin >> M[i]; } memset(dp, -1, sizeof(dp)); if (CanReach(Si, Sj, A)) { cout << "Yes" << endl; } else { cout << "No" << endl; } return 0; }