#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const int MAX=24002400;
int G[MAX][5];

const int k=2520;
int dh[]={1,0,0,0,-1};
int dw[]={0,1,0,-1,0};

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

  int h,w,t;
  cin>>h>>w>>t;
  int sy,sx,gy,gx;
  cin>>sy>>sx>>gy>>gx;
  sy--,sx--,gy--,gx--;
  vector<string> S(h);
  rep(i,h) cin>>S[i];
  vector<vector<int>> A(h,vector<int>(w));
  rep(i,h) rep(j,w) A[i][j]=S[i][j]-'0';
  
  auto f=[&](int i,int j,int l){
    return (A[i][j]-l+k)%(A[i][j]+1);
  };
  auto g=[&](int i,int j,int l){
    return l*h*w+i*w+j;
  };
  
  for(int l=0;l<t-1;l++){
    rep(i,h) rep(j,w){
      if(f(i,j,l)==0) continue;
      int a=g(i,j,l);
      rep(m,5){
        int ni=i+dh[m];
        int nj=j+dw[m];
        if(ni<0 || nj<0 || ni>=h || nj>=w) continue;
        if(f(ni,nj,l+1)!=0) G[a][m]=g(ni,nj,l+1);
      }
    }
  }
  queue<int> que;
  vector<int> vis(h*w*t);
  que.push(g(sy,sx,0));
  vis[g(sy,sx,0)]=1;
  while(que.size()){
    auto v=que.front(); que.pop();
    rep(m,5){
      if(G[v][m]==0) continue;
      int nv=G[v][m];
      if(vis[nv]) continue;
      vis[nv]=1;
      que.push(nv);
    }
  }
  rep(l,t){
    if(vis[g(gy,gx,l)]){
      cout<<"Yes"<<endl;
      return 0;
    }
  }
  cout<<"No"<<endl;

  return 0;
}