using System.Collections.Generic; using System; public class PriorityQueue where T : IComparable { private IComparer _comparer = null; private int _type = 0; private T[] _heap; private int _sz = 0; private int _count = 0; public PriorityQueue(int maxSize, IComparer comparer) { _heap = new T[maxSize]; _comparer = comparer; } public PriorityQueue(int maxSize, int type = 0) { _heap = new T[maxSize]; _type = type; } private int Compare(T x, T y) { if (_comparer != null) return _comparer.Compare(x, y); return _type == 0 ? x.CompareTo(y) : y.CompareTo(x); } public void Push(T x) { _count++; var i = _sz++; while (i > 0) { var p = (i - 1) / 2; if (Compare(_heap[p], x) <= 0) break; _heap[i] = _heap[p]; i = p; } _heap[i] = x; } public T Pop() { _count--; T ret = _heap[0]; T x = _heap[--_sz]; int i = 0; while (i * 2 + 1 < _sz) { int a = i * 2 + 1; int b = i * 2 + 2; if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b; if (Compare(_heap[a], x) >= 0) break; _heap[i] = _heap[a]; i = a; } _heap[i] = x; return ret; } public int Count() => _count; public T Peek() => _heap[0]; public bool Contains(T x) { for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true; return false; } public void Clear() { while (this.Count() > 0) this.Pop(); } public IEnumerator GetEnumerator() { var ret = new List(); while (this.Count() > 0) { ret.Add(this.Pop()); } foreach (var r in ret) { this.Push(r); yield return r; } } public T[] ToArray() { T[] array = new T[_sz]; int i = 0; foreach (var r in this) { array[i++] = r; } return array; } } public class P : IComparable { public int x { get; set; } public int y { get; set; } public long d { get; set; } public int CompareTo(object obj) { var p = (P)obj; if (this.d > p.d) return 1; else if (this.d == p.d) return 0; else return -1; } } public class Hello { static void Main() { string[] line = Console.ReadLine().Trim().Split(' '); var h = int.Parse(line[0]); var w = int.Parse(line[1]); var sx = int.Parse(line[2]) - 1; var sy = int.Parse(line[3]) - 1; getAns(h, w, sx, sy); } static void getAns(int h, int w, int sx, int sy) { var dx = new int[] { 0, 1, 0, -1 }; var dy = new int[] { 1, 0, -1, 0 }; var ans = 0L; var pq = new PriorityQueue

(h * w + 10); var asum = 0L; for (int i = 0; i < h; i++) { string[] line = Console.ReadLine().Trim().Split(' '); for (int j = 0; j < w; j++) { var t = long.Parse(line[j]); asum += t; if (i == sx && j == sy) ans = t; else pq.Push(new P { d = t, x = i, y = j }); } } var map = new bool[h, w]; map[sx, sy] = true; var te = new List

(); while (pq.Count() > 0) { var ww = pq.Pop(); if (ans <= ww.d) { te.Add(ww); continue; } for (int i = 0; i < 4; i++) { var nx = ww.x + dx[i]; var ny = ww.y + dy[i]; if (nx >= 0 && nx < h && ny >= 0 && ny < w && map[nx,ny]) { ans += ww.d; map[ww.x, ww.y] = true; foreach (var z in te) pq.Push(z); te.Clear(); goto next; } } te.Add(ww); next:; } Console.WriteLine(ans == asum? "Yes":"No"); } }