#include<iostream>
#include<algorithm>
#include<queue>
#include<fstream>
using namespace std;
ifstream fin("chess.in");
ofstream fout("chess.out");
long long n,k,sx,sy,fx,fy;
bool a[1024][1024];
void ramka()
{
    int i;
    for(i=0;i<n+4;i++)
    {
        a[0][i]=1;
        a[1][i]=1;
        a[i][0]=1;
        a[i][1]=1;
        a[i][n+2]=1;
        a[i][n+3]=1;
        a[n+2][i]=1;
        a[n+3][i]=1;
    }
}
void read()
{
    int i,j;
    fin>>n>>k>>sx>>sy>>fx>>fy;
    sx+=1; sy+=1;
    fx+=1; fy+=1;
    for(i=2;i<n+2;i++)
        for(j=2;j<n+2;j++)
            fin>>a[i][j];
    ramka();
}
int track[1024][1024];
bool solve()
{
    pair<int,int> dir[8]={{1,2},{2,1},{-1,2},{2,-1},{-1,-2},{-2,-1},{1,-2},{-2,1}};
    queue<pair<int,int> >q;
    int i;
    q.push({sx,sy});
    track[sx][sy]=0;
    while(!q.empty())
    {

        pair<int,int>p=q.front();
        q.pop();
        if(track[p.first][p.second]==k)return false;
        for(i=0;i<8;i++)
        {
            int x,y;
            x=p.first+dir[i].first;
            y=p.second+dir[i].second;
            if(a[x][y]==0)
            {
                if(x==fx&&y==fy)return true;
                a[x][y]=true;
                q.push({x,y});
                track[x][y]=track[p.first][p.second]+1;
            }
        }
    }
    return false;
}
int main()
{
    read();
    if(solve()==1)
        fout<<"Yes\n";
    else fout<<"No\n";
	return 0;
}
/*

5 3 1 1 4 3
0 0 0 0 0
0 0 1 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0

5 3 1 1 4 3
0 0 0 0 0
0 0 1 1 0
0 0 0 0 0
0 0 0 0 0
1 0 0 0 0

*/