#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

constexpr int dx[4] = {1, 0, -1, 0};
constexpr int dy[4] = {0, 1, 0, -1};

bool dp[55][55][2005];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int H, W, A, sx, sy, B, gx, gy;
    cin >> H >> W >> A >> sx >> sy >> B >> gx >> gy;
    vector<string> M(H);
    for(int i = 0; i < H; ++i)  cin >> M[i];

    dp[sx][sy][A] = true;
    queue<tuple<int, int, int>> que;
    que.emplace(sx, sy, A);
    while(!que.empty()){
        auto [x, y, k] = que.front();
        que.pop();
        for(int i = 0; i < 4; ++i){
            int nx = x + dx[i], ny = y + dy[i];
            if(nx < 0 || nx >= H || ny < 0 || ny >= W)  continue;
            if(M[nx][ny] == '.'){
                if(k > 1 && !dp[nx][ny][k - 1]){
                    dp[nx][ny][k - 1] = true;
                    que.emplace(nx, ny, k - 1);
                }
            }
            else{
                if(k < 2000 && !dp[nx][ny][k + 1]){
                    dp[nx][ny][k + 1] = true;
                    que.emplace(nx, ny, k + 1);
                }
            }
        }
    }

    cout << (dp[gx][gy][B] ? "Yes\n" : "No\n");

    return 0;
}