using static System.Math;
using System.Collections.Generic;
using System;

public class PriorityQueue<T> where T : IComparable
{
	private IComparer<T> _comparer = null;
	private int _type = 0;
	private T[] _heap;
	private int _sz = 0;
	private int _count = 0;
	public PriorityQueue(int maxSize, IComparer<T> 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<T> GetEnumerator()
	{
		var ret = new List<T>();
		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 Edge
{
	public int to1 { get; set; }
	public int to2 { get; set; }
	public int d { get; set; }
}
public class Node : IComparable
{
	public int id1 { get; set; }
	public int id2 { get; set; }
	public int d { get; set; }
	public int CompareTo(object obj)
	{
		var x = (Node)obj;
		if (this.d > x.d) return 1;
		else if (this.d == x.d) return 0;
		else return -1;
	}
}

public class hello
{
	public static int w, h, yosan, oxmax, oxstart;
	public static int BIG = 99999999;
	public static void goDijk(List<Edge>[,] aa, int r1, int r2, int[,] mind)
	{
		var pq = new PriorityQueue<Node>(30000, 0);
		pq.Push(new Node { id1 = r1, id2 = r2, d = 0 });
		while (pq.Count() > 0)
		{
			var targ = pq.Pop();
			var nowd = targ.d;
			var nowid1 = targ.id1;
			var nowid2 = targ.id2;
			if (mind[nowid1, nowid2] < nowd) continue;
			mind[nowid1, nowid2] = nowd;
			foreach (var x in aa[nowid1, nowid2])
				if (nowd + x.d < mind[x.to1, x.to2])
				{
					mind[x.to1, x.to2] = nowd + x.d;
					pq.Push(new Node { id1 = x.to1, id2 = x.to2, d = nowd + x.d });
				}
		}
	}

	public static void Main()
	{
		while (true)
		{
			string[] line = Console.ReadLine().Trim().Split(' ');
			w = int.Parse(line[0]);
			h = int.Parse(line[1]);
			if (w == 0 && h == 0) break;
			line = Console.ReadLine().Trim().Split(' ');
			yosan = int.Parse(line[0]);
			oxmax = int.Parse(line[1]);
			oxstart = int.Parse(line[2]);
			var map = new int[h, w];
			for (int i = 0; i < h; i++)
			{
				line = Console.ReadLine().Trim().Split(' ');
				for (int j = 0; j < w; j++) map[i, j] = -int.Parse(line[j]);
			}
			if (oxstart <= 1) { Console.WriteLine("NA"); goto exit; }
			var aa = setEdge(map);
			var ans = BIG;
			for (int i = 0; i < w; i++)
			{
				var mind = new int[(h + 1) * w + 1, oxmax + 1];
				for (int j = 0; j < (h + 1) * w + 1; j++)
					for (int k = 0; k < oxmax + 1; k++) mind[j, k] = BIG;
				goDijk(aa, i, oxstart, mind);
				var t = getAns(mind);
				if (t != -1) ans = Min(ans, t);
			}
			if (ans > yosan) Console.WriteLine("NA");
			else Console.WriteLine(ans);
			exit:;
		}
	}
	static int getAns(int[,] mind)
	{
		var ans = int.MaxValue;
		for (int i = 0; i < w; i++)
		{
			var p = getPanel(h - 1, i);
			for (int j = 0; j < oxmax + 1; j++)
				ans = Min(ans, mind[p, j]);
		}
		return ans == BIG ? -1 : ans;
	}
	static List<Edge>[,] setEdge(int[,] map)
	{
		var dx = new int[] { 0, 1, 0 };
		var dy = new int[] { 1, 0, -1 };
		var aa = new List<Edge>[(h + 1) * w + 1, oxmax + 1];
		for (int i = 0; i < (h + 1) * w + 1; i++)
			for (int j = 0; j < oxmax + 1; j++) aa[i, j] = new List<Edge>();

		for (int i = 0; i < w; i++)
			if (map[0, i] > 0)
				aa[i, oxstart].Add(new Edge { to1 = getPanel(0, i), to2 = oxstart - 1, d = map[0, i] });
			else
			{
				var ox2 = Min(oxmax, oxstart - 1 - map[0, i]);
				aa[i, oxstart].Add(new Edge { to1 = getPanel(0, i), to2 = ox2, d = 0 });
			}

		for (int i = 0; i < h - 1; i++)
			for (int j = 0; j < w; j++)
				for (int k = 0; k < 3; k++)
				{
					var nx = i + dx[k];
					var ny = j + dy[k];
					if (nx >= 0 && nx < h && ny >= 0 && ny < w)
						if (map[nx, ny] > 0)
						{
							for (int L = 2; L <= oxmax; L++)
								aa[getPanel(i, j), L].Add(new Edge { to1 = getPanel(nx, ny), to2 = L - 1, d = map[nx, ny] });
						}
						else
						{
							for (int L = 2; L <= oxmax; L++)
							{
								var ox2 = Min(oxmax, L - 1 - map[nx, ny]);
								aa[getPanel(i, j), L].Add(new Edge { to1 = getPanel(nx, ny), to2 = ox2, d = 0 });
							}
						}
				}
		return aa;
	}
	static int getPanel(int x, int y) => w * x + y + w;
}



Measured memory_bytes: 34544