#include <bits/stdc++.h>
#include <atcoder/all>
// url 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double lld;
using namespace std;
using namespace atcoder;
using mint = static_modint<998244353>;
const ll mod=998244353;
// using mint = static_modint<1000000007>;
//const ll mod=1e9+7;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const string zton="0123456789";
const string atoz="abcdefghijklmnopqrstuvwxyz";
const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ll inf=(1ll<<60);
// const int inf=(1<<30);
lld dist(lld x1,lld x2,lld y1,lld y2){
    lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    res=sqrt(abs(res));
    return res;
}
lld arg(lld x,lld y){
    const lld eps=1e-8;
    lld res=0;
    if(abs(x)+abs(y)<=eps)return 0.0;
    else if(abs(x)<=eps){
        if(y>=0.0)return (M_PI/2);
        else return (M_PI/2+M_PI);
    }
    else if(abs(y)<=eps){
        if(x>=0.0)return 0.0;
        else return M_PI;
    }
    res=atan2(abs(y),abs(x));
    if(x<=0&&y>=0)res=(M_PI-res);
    else if(x<=0&&y<=0)res+=(M_PI);
    else if(x>=0&&y<=0)res=(M_PI*2-res);
    return res;
}
ll gcd(ll a,ll b){
    if(a==0||b==0)return a+b;
    ll r;
    r=a%b;
    if(r==0){
        return b;
    }
    else{
        return gcd(b,r);
    }
}
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}
__int128 parse128(string &s) {
    __int128 ret = 0;
    for (int i = 0; i < s.length(); i++){
        if ('0' <= s[i] && s[i] <= '9'){
            ret = 10 * ret + s[i] - '0';
        }
    }
    return ret;
}
using l3 = __int128;
typedef pair<ll,int> P;
typedef tuple<ll,int,int,ll> P2;
const int KK=400;
const int offset=200;
ll dp[85][85][KK];

int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,M;cin >> N >> M;
    int K,T;cin >> K >> T;
    if(T>=N+M-1){
        cout << 0 << endl;
        return 0;
    }
    ll C[N][M],D[N][M];
    rep(i,0,N)rep(j,0,M){
        C[i][j]=0;
        D[i][j]=0;
    }
    rep(i,0,K){
        int a,b;cin >> a >> b;
        a--;b--;
        cin >> C[a][b] >> D[a][b];
    }

    vector<P2> G[N][M];
    rep(i,0,N)rep(j,0,M){
        rep(k,0,4){
            int ni=i+dx[k],nj=j+dy[k];
            if(ni<0||ni>=N||nj<0||nj>=M)continue;
            P2 np=make_tuple(0,ni,nj,1);
            G[i][j].pb(np);
        }
        P2 np=make_tuple(D[i][j],i,j,-C[i][j]+1);
        G[i][j].pb(np);
    }
    // rep(i,0,N){
    //     rep(j,0,M){
    //         cout << G[i][j].size() << " ";
    //     }
    //     cout << endl;
    // }

    rep(i,0,N)rep(j,0,M)rep(k,0,KK)dp[i][j][k]=inf;
    dp[0][0][offset]=0;
    priority_queue<P2,vector<P2>,greater<P2>> que;
    que.push(make_tuple(0,0,0,offset));
    while(que.size()){
        P2 p=que.top();que.pop();
        int i=get<1>(p),j=get<2>(p);
        ll k=get<3>(p);
        ll cost=get<0>(p);
        if(dp[i][j][k]<cost)continue;
        for(auto np:G[i][j]){
            int ni=get<1>(np),nj=get<2>(np);
            ll nk=k+get<3>(np);
            chmin(nk,1ll*KK-1);
            chmax(nk,0ll);
            if(chmin(dp[ni][nj][nk],cost+get<0>(np))){
                que.push(make_tuple(dp[ni][nj][nk],ni,nj,nk));
            }
        }
    }
    chmin(T,199);
    ll ans=inf;
    rep(i,0,KK){
        if(i<=offset+T){
            chmin(ans,dp[N-1][M-1][i]);
        }
    }
    if(ans==inf)ans=-1;
    cout << ans << endl;

}