import sequtils,strutils,deques
type
    zahyou = tuple[x : int, y : int]
var
    N,V,Ox,Oy : int
    sabaku : array[202,array[202,int]]
    line : seq[int]
    D = [[1,0],[0,1],[-1,0],[0,-1]]
    startcost : seq[seq[int]]
    gorlcost : seq[seq[int]]
    p : zahyou

(N,V,Ox,Oy) = stdin.readline.split.map(parseInt)

for i in 0..201:
    for j in 0..201:
        sabaku[i][j] = 1000000
for i in 0..<N:
    line = stdin.readline.split.map(parseInt)
    for j in 0..<N:
        sabaku[i + 1][j + 1] = line[j]

for i in 0..1:
    var
        S = newSeqWith(N + 2,newSeqWith(N + 2,1000000))
        update = initDeque[zahyou](4096)
        s : set[int16]
        k : int16
    if i == 0:
        p = (1,1)
        update.addLast(p)
        s.incl(201)
        S[1][1] = 0
    else:
        p = (N,N)
        update.addLast(p)
        s.incl((N * 200 + N).int16)
        S[N][N] = sabaku[N][N]
    while s.card > 0:
        p = update.popFirst
        k = (p.y * 200 + p.x).int16
        s.excl(k)
        for d in D:
            if S[p.x + d[0]][p.y + d[1]] > S[p.x][p.y] + sabaku[p.x + d[0]][p.y + d[1]]:
                S[p.x + d[0]][p.y + d[1]] = S[p.x][p.y] + sabaku[p.x + d[0]][p.y + d[1]]
                k = ((p.y + d[1]) * 200 + p.x + d[0]).int16
                if k notin s:
                    s.incl(k)
                    update.addLast((p.x + d[0],p.y + d[1]))
    if i == 0:
        startcost = S
    else:
        gorlcost = S

var Vo = V - startcost[Oy][Ox]
Vo *= 2
Vo += sabaku[Oy][Ox]
if Vo > gorlcost[Oy][Ox] or startcost[N][N] < V:
    echo "YES"
else:
    echo "NO"