/* -*- coding: utf-8 -*-
 *
 * 2646.cc:  No.2646 Cycle Maze - yukicoder
 */

#include<cstdio>
#include<queue>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_H = 200;
const int MAX_W = 200;
const int MAX_HW = MAX_H * MAX_W;
const int dxs[] = { 1, 0, -1, 0, 0 }, dys[] = { 0, -1, 0, 1, 0 };

/* typedef */

typedef queue<int> qi;

/* global variables */

char s[MAX_HW + 4];
bool ds[MAX_HW];

/* subroutines */

/* main */

int main() {
  int h, w, t, sy, sx, gy, gx;
  scanf("%d%d%d%d%d%d%d", &h, &w, &t, &sy, &sx, &gy, &gx);
  sy--, sx--, gy--, gx--;
  int hw = h * w, st = sy * w + sx, gl = gy * w + gx;

  for (int i = 0; i < h; i++) scanf("%s", s + i * w);

  qi uq;
  uq.push(st);
  int d = 0;

  while (d < t) {
    d++;
    fill(ds, ds + hw, false);
    qi vq;

    while (! uq.empty()) {
      int u = uq.front(); uq.pop();
      int uy = u / w, ux = u % w;

      for (int di = 0; di < 5; di++) {
	int vy = uy + dys[di], vx = ux + dxs[di], v = vy * w + vx;
	if (vy >= 0 && vy < h && vx >= 0 && vx < w && ! ds[v]) {
	  int av = (s[v] - '0');
	  int bv = (av - d) % (av + 1);
	  if (bv != 0) {
	    ds[v] = true;
	    vq.push(v);
	  }
	}
      }
    }

    if (ds[gl]) break;
    swap(uq, vq);
  }

  if (ds[gl]) puts("Yes");
  else puts("No");

  return 0;
}