//codeit sprint 1

#include<fstream>
using namespace std;

ifstream fin("chess.in");
ofstream fout("chess.out");

int n, k, x1, y1, x2, y2;
bool table[1024][1024];
bool ans=false;

bool beenThere[1024][1024][2];

void solve(int x, int y, int p)
{
    //fout<<x<<" "<<y<<" "<<p<<endl;

    if(beenThere[x][y][p%2])
        return;

    beenThere[x][y][p%2]=true;
    if(x==x2 && y==y2)
    {
        if((k-p)%2==0)
        {
            ans=true;
        }
    }

    if(!table[x][y] && !ans && p<k)
    {
            if(x-2>=0 && y-1>=0)
                solve(x-2, y-1, p+1);

            if(x-2>=0 && y+1<=n-1)
                solve(x-2, y+1, p+1);

            if(x+2<=n-1 && y+1<=n-1)
                solve(x+2, y+1, p+1);

            if(x+2<=n-1 && y-1>=0)
                solve(x+2, y-1, p+1);

            ///

            if(x-1>=0 && y-2>=0)
                solve(x-1, y-2, p+1);

            if(x-1>=0 && y+2<=n-1)
                solve(x-1, y+2, p+1);

            if(x+1<=n-1 && y+2<=n-1)
                solve(x+1, y+2, p+1);

            if(x+1<=n-1 && y-2>=0)
                solve(x+1, y-2, p+1);
    }
}

int main()
{
    fin>>n>>k>>x1>>y1>>x2>>y2;

    x2--;
    y2--;

    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
            fin>>table[i][j];
    }

    solve(x1-1, y1-1, 0);

    if(ans)
        fout<<"Yes"<<endl;
    else fout<<"No"<<endl;

    fin.close();
    fout.close();
    return 0;
}