using System; using System.Linq; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; //using System.Numerics; namespace Program { public class Solver { public void Solve() { var n = sc.Integer(); var hp = sc.Integer(); var w = sc.Integer() - 1; var h = sc.Integer() - 1; var map = Enumerate(n, x => sc.Integer(n)); var dist = new int[n, n]; dist[0, 0] = hp; var pq = new MergeablePriorityQueue>((l,r)=>r.Value.CompareTo(l.Value)); pq.Enqueue(new KeyValuePair(0, hp)); int[] dx = { -1, 1, 0, 0 }; int[] dy = { 0, 0, 1, -1 }; Action run = () => { while (pq.Any()) { var p = pq.Dequeue(); var r = p.Key / n; var c = p.Key % n; if (dist[r, c] > p.Value) continue; for (int i = 0; i < 4; i++) { var nx = r + dx[i]; var nc = c + dy[i]; if (nx < 0 || nx >= n || nc < 0 || nc >= n) continue; if (dist[nx, nc] < p.Value - map[nx][nc]) { dist[nx, nc] = p.Value - map[nx][nc]; pq.Enqueue(new KeyValuePair(nx * n + nc, dist[nx, nc])); } } } }; run(); if (w >= 0 && h >= 0) pq.Enqueue(new KeyValuePair(h * n + w, dist[h, w] * 2)); run(); if(dist[n-1,n-1]>0) IO.Printer.Out.WriteLine("YES"); else IO.Printer.Out.WriteLine("NO"); } internal IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } static T[] Enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } } } #region Ex namespace Program.IO { using System.IO; using System.Linq; public class Printer : StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return System.Globalization.CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new System.Text.UTF8Encoding(false, true)) { } public void Write(string format, IEnumerable source) { base.Write(format, source.OfType().ToArray()); } public void WriteLine(string format, IEnumerable source) { base.WriteLine(format, source.OfType().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } private readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; } public char[] Char(int n) { var a = new char[n]; for (int i = 0; i < n; i++) a[i] = Char(); return a; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { return double.Parse(Scan(), System.Globalization.CultureInfo.InvariantCulture); } private T[] enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } public void Flush() { str.Flush(); } } } static class Ex { static public string AsString(this IEnumerable ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString(this IEnumerable ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region PriorityQueue and PairingHeap public class MergeablePriorityQueue { PairingHeap top; Comparison compare; int size; public int Count { get { return size; } } public MergeablePriorityQueue() : this(Comparer.Default) { } public MergeablePriorityQueue(Comparison comparison) { compare = comparison; } public MergeablePriorityQueue(IComparer comparer) { compare = comparer.Compare; } public void Enqueue(T item) { var heap = new PairingHeap(item); top = PairingHeap.Merge(top, heap, compare); size++; } public T Dequeue() { var ret = top.Key; size--; top = PairingHeap.Pop(top, compare); return ret; } public bool Any() { return size > 0; } public T Peek() { return top.Key; } } #region PairingHeap public class PairingHeap { public PairingHeap(T k) { key = k; } private readonly T key; public T Key { get { return key; } } private PairingHeap head; private PairingHeap next; static public PairingHeap Pop(PairingHeap s, Comparison compare) { return MergeLst(s.head, compare); } static public PairingHeap Merge(PairingHeap l, PairingHeap r, Comparison compare) { if (l == null || r == null) return l == null ? r : l; if (compare(l.key, r.key) > 0) Swap(ref l, ref r); r.next = l.head; l.head = r; return l; } static public PairingHeap MergeLst(PairingHeap s, Comparison compare) { var n = new PairingHeap(default(T)); while (s != null) { PairingHeap a = s, b = null; s = s.next; a.next = null; if (s != null) { b = s; s = s.next; b.next = null; } a = Merge(a, b, compare); a.next = n.next; n.next = a; } while (n.next != null) { var j = n.next; n.next = n.next.next; s = Merge(j, s, compare); } return s; } static void Swap(ref PairingHeap l, ref PairingHeap r) { var t = l; l = r; r = t; } } #endregion #endregion