#include<bits/stdc++.h>
using namespace std;
using ll = long long;


ll memo[81][81][15000];
int vis[81][81][15000];
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false); 

    ll ans = 1e18;
    ll n,m,k,t;
    cin>>n>>m>>k>>t;
    vector<vector<pair<ll,ll>>> use(n,vector<pair<ll,ll>>(m));
    for(int i = 0;i<k;i++){
        ll a,b,c,d;
        cin>>a>>b>>c>>d;
        a--;b--;
        use[a][b] = make_pair(c,d);
    }
    using dat = pair<ll,pair<ll,ll>>;
    priority_queue<pair<ll,dat>,vector<pair<ll,dat>>,greater<pair<ll,dat>>> que;
    que.push(make_pair(0,make_pair(0,make_pair(0,0))));
    int dx[] = {1,-1,0,0};
    int dy[] = {0,0,1,-1};
    for(int i = 0;i<n;i++) for(int j = 0;j<m;j++) for(int k = 0;k<15000;k++) memo[i][j][k] = 1e18;

    ll can = 1e18;
    while(!que.empty()){
        auto now = que.top();
        que.pop();
        int ni = now.second.second.first;
        int nj = now.second.second.second;
        if(vis[ni][nj][now.second.first+7000]++) continue;
        if(ni==n-1&&nj==m-1){
            if(now.second.first>t) continue;
            ans = min(ans,now.first);
            continue;
        }
        for(int k = 0;k<4;k++){
            int nni = ni + dx[k];
            int nnj = nj + dy[k];
            if(nni<0||nnj<0||nni>=n||nnj>=m) continue;
            ll nxt = now.second.first;
            nxt++;
            ll cost = now.first;
            if(use[nni][nnj].first!=0){
                nxt++;
                nxt -= use[nni][nnj].first;
                cost += use[nni][nnj].second;
            }
            if(nxt<=-7000) nxt = -7000;
            if(nxt>=7000) nxt = 7000;
            dat will = make_pair(nxt,make_pair(nni,nnj));
            if(memo[nni][nnj][nxt+7000]<=cost) continue;
            memo[nni][nnj][nxt+7000];
            que.push(make_pair(cost,will));
        }
    }
    if(ans==1e18) ans = -1;
    cout<<ans<<endl;
}