import heapq

def chmin(a,b):
    if a>b:
        return True
    return False

N,M,K,T=map(int,input().split())
C=[[0]*M for i in range(N)]
D=[[0]*M for i in range(N)]

def valid(i,j):
    return 0<=i and i<N and 0<=j and j<M

for i in range(K):
    a,b,c,d=map(int,input().split())
    C[a-1][b-1]=c
    D[a-1][b-1]=d

INF=10**15
dp=[[[INF]*M for i in range(N)] for j in range(2*(N+M)+1)]
dp[0+N+M][0][0]=0

q=[(0,0+N+M,0,0)]
dxy=[(0,1),(1,0),(0,-1),(-1,0)]

while len(q):
    tir,time,a,b=heapq.heappop(q)
    if dp[time][a][b] < tir:
        continue
    for dx,dy in dxy:
        na,nb = a+dx, b+dy
        if valid(na,nb) and time<2*(N+M) and dp[time+1][na][nb] > tir:
            dp[time+1][na][nb]=dp[time][a][b]
            heapq.heappush(q,(tir,time+1,na,nb))
    
    if C[a][b]>0 and D[a][b]>0:
        ntime=max(0,time-C[a][b]+1)
        if dp[ntime][a][b] > tir+D[a][b]:
            dp[ntime][a][b]=tir+D[a][b]
            heapq.heappush(q,(dp[ntime][a][b],ntime,a,b))

ans=INF

for i in range(-(N+M),min(T+1,N+M+1)):
    ans=min(ans,dp[i+N+M][N-1][M-1])

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