#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int posokaX[8] = {-1,1,2,2,1,-1,-2,-2};
int posokaY[8] = {-2,-2,-1,1,2,2,1,-1};
bool table[1024][1024];
int obhodeni[1024][1024];
int n;
void bfs(int nx, int ny)
{
    obhodeni[nx][ny] =1;
    queue<int> q;
    q.push(nx);
    q.push(ny);
    while(!q.empty())
    {
        int x = q.front(); q.pop();
        int y = q.front(); q.pop();
        for(int i=0;i<8;i++)
        {
            if(x+posokaX[i]>=0 && x+posokaX[i]<n && y+posokaY[i]>=0 && y+posokaY[i]<n)
            {
                if(table[x+posokaX[i]][y+posokaY[i]]==0 && !obhodeni[x+posokaX[i]][y+posokaY[i]])
                {
                    obhodeni[x+posokaX[i]][y+posokaY[i]] = obhodeni[x][y]+1;
                    q.push(x+posokaX[i]);
                    q.push(y+posokaY[i]);
                }
            }
        }
    }
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    freopen("chess.in","r",stdin);
    freopen("chess.out","w",stdout);
    int k,x1,y1,x2,y2;
    cin>>n>>k>>y1>>x1>>y2>>x2;
    for(int y=0; y<n;y++)
    {
        for(int x=0;x<n;x++)
            cin>>table[x][y];
    }
    x1--; x2--; y1--; y2--;
    bfs(x1,y1);
    k++;
    /*for(int y=0; y<n;y++)
    {
        for(int x=0; x<n; x++)
            cout<<obhodeni[x][y]<<" ";
        cout<<endl;
    }*/
    if(obhodeni[x1][y1]==k)
    {
        cout<<"Yes\n"; return 0;
    }
    for(int i=0;i<8;i++)
    {
        if(x2+posokaX[i]>=0 && x2+posokaX[i]<n && y2+posokaY[i]>=0 && y2+posokaY[i]<n)
            {
                if(obhodeni[x2+posokaX[i]][y2+posokaY[i]]>0 && obhodeni[x2+posokaX[i]][y2+posokaY[i]]<k && obhodeni[x2+posokaX[i]][y2+posokaY[i]]%2!=k%2  )
                {
                    cout<<"Yes\n";
                    return 0;
                }
            }
    }
    cout<<"No\n";
    return 0;
}