using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (h, w, k, t) = (c[0], c[1], c[2], c[3]);
        var map = NArr(k);
        WriteLine(School(h, w, k, t, map));
    }
    static long School(int h, int w, int k, int t, int[][] map)
    {
        var wonder = new (int c, int d)[h][];
        for (var i = 0; i < wonder.Length; ++i) wonder[i] = new (int c, int d)[w];
        for (var i = 0; i < map.Length; ++i)
        {
            wonder[map[i][0] - 1][map[i][1] - 1] = (map[i][2], map[i][3]);
        }

        var INF = long.MaxValue / 2;
        var max = 158 * 3 + 1;
        var init = Enumerable.Repeat(INF, max).ToArray();
        var dp = new long[h][][];
        for (var i = 0; i < dp.Length; ++i)
        {
            dp[i] = new long[w][];
            for (var j = 0; j < dp[i].Length; ++j) dp[i][j] = (long[]) init.Clone();
        }
        dp[0][0][158] = 0;

        var mx = new int[] { 0, 0, -1, 1 };
        var my = new int[] { -1, 1, 0, 0 };
        var q = new PriorityQueue<Pair>(h * w, false);
        q.Enqueue(new Pair(0, 0, 158, 0));
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            if (dp[cur.X][cur.Y][cur.T] != cur.Val) continue;
            for (var i = 0; i < 4; ++i)
            {
                var nx = cur.X + mx[i];
                var ny = cur.Y + my[i];
                var nt = cur.T + 1;
                if (nx < 0 || nx >= h || ny < 0 || ny >= w || nt >= max) continue;
                if (dp[nx][ny][nt] <= cur.Val) continue;
                dp[nx][ny][nt] = cur.Val;
                q.Enqueue(new Pair(nx, ny, nt, cur.Val));
            }
            if (wonder[cur.X][cur.Y].c > 0)
            {
                var nt = Math.Max(0, cur.T - wonder[cur.X][cur.Y].c + 1);
                var nv = cur.Val + wonder[cur.X][cur.Y].d;
                if (dp[cur.X][cur.Y][nt] <= nv) continue;
                dp[cur.X][cur.Y][nt] = nv;
                q.Enqueue(new Pair(cur.X, cur.Y, nt, nv));
            }
        }
        var ans = INF;
        for (var i = 0; i < t + 158; ++i) ans = Math.Min(ans, dp[h - 1][w - 1][i]);
        return ans == INF ? -1 : ans;
    }
    class Pair: IComparable<Pair>
    {
        public int X;
        public int Y;
        public int T;
        public long Val;
        public Pair(int x, int y, int t, long val)
        {
            X = x; Y = y; T = t; Val = val;
        }
        public int CompareTo(Pair b)
        {
            return Val.CompareTo(b.Val);
        }
    }
    class PriorityQueue<T> where T : IComparable<T>
    {
        public T[] List;
        public int Count;
        bool IsTopMax;
        public PriorityQueue(int count, bool isTopMax)
        {
            IsTopMax = isTopMax;
            List = new T[Math.Max(128, count)];
        }
        public void Enqueue(T value)
        {
            if (Count == List.Length)
            {
                var newlist = new T[List.Length * 2];
                for (var i = 0; i < List.Length; ++i) newlist[i] = List[i];
                List = newlist;
            }
            var pos = Count;
            List[pos] = value;
            ++Count;
            while (pos > 0)
            {
                var parent = (pos - 1) / 2;
                if (Calc(List[parent], List[pos], true)) break;
                Swap(parent, pos);
                pos = parent;
            }
        }
        public T Dequeue()
        {
            --Count;
            Swap(0, Count);
            var pos = 0;
            while (true)
            {
                var child = pos * 2 + 1;
                if (child >= Count) break;
                if (child + 1 < Count && Calc(List[child + 1], List[child], false)) ++child;
                if (Calc(List[pos], List[child], true)) break;
                Swap(pos, child);
                pos = child;
            }
            return List[Count];
        }
        bool Calc(T a, T b, bool equalVal)
        {
            var ret = a.CompareTo(b);
            if (ret == 0 && equalVal) return true;
            return IsTopMax ? ret > 0 : ret < 0;
        }
        void Swap(int a, int b)
        {
            var tmp = List[a];
            List[a] = List[b];
            List[b] = tmp;
        }
    }
}