# include <iostream>
# include <cstdio>
# include <queue>
# include <vector>
# include <stack>
# include <map>
# include <cmath>
# include <algorithm>
# include <stdio.h>
using namespace std;
bool l[1005][1005];
int  vis[1005][1005];
int n,k;
void backtrack(int x, int y,int nums)
{
    //cout<<x<<" "<<y<<" "<<nums<<" "<<k<<endl;
    if(nums>=k)return ;
   // cout<<"j"<<endl;
    int a,b;
    a = x + 2;
    b = y + 1;
  //  cout<<a<<b<<endl;
    if(a>=1&&a<=n&&b>=1&&b<=n&&!l[a][b]&&!vis[a][b]){vis[a][b]=1;backtrack(a,b,nums+1);}
      a = x + 2;
    b = y - 1;
    if(a>=1&&a<=n&&b>=1&&b<=n&&!l[a][b]&&!vis[a][b]){vis[a][b]=1;backtrack(a,b,nums+1);}
      a = x + 1;
    b = y - 2;
    if(a>=1&&a<=n&&b>=1&&b<=n&&!l[a][b]&&!vis[a][b]){vis[a][b]=1;backtrack(a,b,nums+1);}
      a = x - 1;
    b = y - 2;
    if(a>=1&&a<=n&&b>=1&&b<=n&&!l[a][b]&&!vis[a][b]){vis[a][b]=1;backtrack(a,b,nums+1);}
      a = x - 2;
    b = y + 1;
    if(a>=1&&a<=n&&b>=1&&b<=n&&!l[a][b]&&!vis[a][b]){vis[a][b]=1;backtrack(a,b,nums+1);}
      a = x - 2;
    b = y - 1;
    if(a>=1&&a<=n&&b>=1&&b<=n&&!l[a][b]&&!vis[a][b]){vis[a][b]=1;backtrack(a,b,nums+1);}
      a = x + 1;
    b = y + 2;
    if(a>=1&&a<=n&&b>=1&&b<=n&&!l[a][b]&&!vis[a][b]){vis[a][b]=1;backtrack(a,b,nums+1);}
      a = x - 1;
    b = y + 2;
    if(a>=1&&a<=n&&b>=1&&b<=n&&!l[a][b]&&!vis[a][b]){vis[a][b]=1;backtrack(a,b,nums+1);}
}
int main()
{
     ios_base::sync_with_stdio(false);
    cin.tie(NULL);
freopen ("chess.out","w",stdout);
freopen ("chess.in","r",stdin);
//int n;
cin>>n;
int i,j;
int x1,y1,x2,y2;
cin>>k>>x1>>y1>>x2>>y2;
for(i=1;i<=n;i++)
{
    for(j=1;j<=n;j++)
        cin>>l[i][j];
}
backtrack(x1,y1,0);
//cout<<vis[x2][y2]<<endl;
if(vis[x2][y2]&&(((x1+y1)%2==(x2+y2)%2&&k%2==0)||((x1+y1)%2!=(x2+y2)%2&&k%2==1))){cout<<"Yes"<<endl;}
else
    cout<<"No"<<endl;
}