DR = [1, 0, -1, 0]
DC = [0, 1, 0, -1]
h, w, y, x = read_line.split.map(&.to_i)
y -= 1
x -= 1
a = Array.new(h) { read_line.split.map(&.to_i64) }
cur = a[y][x]
visited = Array.new(h) { Array.new(w, false) }
visited[y][x] = true
q = PriorityQueue({Int64, Int32, Int32}).new(h * w)
4.times do |i|
  ny = y + DR[i]
  nx = x + DC[i]
  if 0 <= ny && ny < h && 0 <= nx && nx < w
    visited[ny][nx] = true
    q.add({-a[ny][nx], ny, nx})
  end
end
while q.size > 0
  v, cy, cx = q.pop
  v *= -1
  if v >= cur
    puts "No"
    exit
  end
  cur += v
  4.times do |i|
    ny = cy + DR[i]
    nx = cx + DC[i]
    if 0 <= ny && ny < h && 0 <= nx && nx < w && !visited[ny][nx]
      visited[ny][nx] = true
      q.add({-a[ny][nx], ny, nx})
    end
  end
end
puts "Yes"

class PriorityQueue(T)
  def initialize(capacity : Int32)
    @elem = Array(T).new(capacity)
  end

  def initialize(list : Enumerable(T))
    @elem = list.to_a
    1.upto(size - 1) { |i| fixup(i) }
  end

  def size
    @elem.size
  end

  def add(v)
    @elem << v
    fixup(size - 1)
  end

  def top
    @elem[0]
  end

  def pop
    ret = @elem[0]
    last = @elem.pop
    if size > 0
      @elem[0] = last
      fixdown(0)
    end
    ret
  end

  def clear
    @elem.clear
  end

  def decrease_top(new_value : T)
    @elem[0] = new_value
    fixdown(0)
  end

  def to_s(io : IO)
    io << @elem
  end

  private def fixup(index : Int32)
    while index > 0
      parent = (index - 1) // 2
      break if @elem[parent] >= @elem[index]
      @elem[parent], @elem[index] = @elem[index], @elem[parent]
      index = parent
    end
  end

  private def fixdown(index : Int32)
    while true
      left = index * 2 + 1
      break if left >= size
      right = index * 2 + 2
      child = right >= size || @elem[left] > @elem[right] ? left : right
      if @elem[child] > @elem[index]
        @elem[child], @elem[index] = @elem[index], @elem[child]
        index = child
      else
        break
      end
    end
  end
end