import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from heapq import *

h,w,k,t=LI()
n=h+w-2
if t>=n:
    print(0)
    exit()

cc=[0]*(h*w)
dd=[0]*(h*w)
for _ in range(k):
    i,j,c,d=LI()
    ij=(i-1)*w+j-1
    cc[ij]=c
    dd[ij]=d

dp=[[inf]*(n*2+1) for _ in range(h*w)]
dp[0][t]=0
hp=[(0,0,t)]
ans=inf

def push(ij,k,d):
    if abs(k)>=n:return
    if d < dp[ij][k]:
        dp[ij][k] = d
        heappush(hp, (d, ij, k))

while hp:
    d,ij,k=heappop(hp)
    if d>dp[ij][k]:continue
    i,j=divmod(ij,w)
    if i:push(ij-w,k-1,d)
    if j:push(ij-1,k-1,d)
    if i+1<h:push(ij+w,k-1,d)
    if j+1<w:push(ij+1,k-1,d)
    if cc[ij]:
        nk=k+cc[ij]-1
        nd=d+dd[ij]
        if nk>=n-i-j:
            ans=min(ans,nd)
        else:
            push(ij,nk,nd)

if ans==inf:ans=-1
print(ans)