#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
void Main()
{
	int H,W,T;
	cin >> H >> W >> T;
	int si,sj,gi,gj;
	cin >> si >> sj >> gi >> gj;
	si--; sj--; gi--; gj--;
	vector<string> A(H);
	for(int i = 0;i < H;i++)
	{
		cin >> A[i];
	}
	auto f = [&](int i,int j,int t) -> int
	{
		int a = A[i][j] - '0';
		int res = a - t;
		res %= (a + 1);
		if(res < 0)
		{
			res += a + 1;
		}
		return res;
	};
	vector<vector<int>> dp(H,vector<int>(W));
	dp[si][sj] = 1;
	const int d[5] = {0,1,0,-1};
	for(int t = 1;t < T;t++)
	{
		vector<vector<int>> n_dp(H,vector<int>(W));
		for(int i = 0;i < H;i++)
		{
			for(int j = 0;j < W;j++)
			{
				if(dp[i][j])
				{
					for(int k = 0;k < 4;k++)
					{
						int ni = i + d[k];
						int nj = j + d[k + 1];
						if(ni < 0 || nj < 0 || ni >= H || nj >= W || f(ni,nj,t) == 0)
						{
							continue;
						}
						n_dp[ni][nj] = 1;
					}
					if(f(i,j,t) != 0)
					{
						n_dp[i][j] = 1;
					}
				}
			}
		}
		swap(dp,n_dp);
		if(dp[gi][gj])
		{
			cout << "Yes\n";
			return;
		}
	}
	cout << "No\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}