#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
// const double PI = 3.141592653589;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif
const int MAX = 20000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    // 
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll num, ll arity) {
    ll ret = 0;
    while (num) {
        num /= arity;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
vector<ll> compress(vector<ll>& v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
    return v;
}

vector<ll> Eratosthenes( const ll N )
{
    vector<bool> is_prime( N + 1 );
    for( ll i = 0; i <= N; i++ )
    {
        is_prime[ i ] = true;
    }
    vector<ll> P;
    for( ll i = 2; i <= N; i++ )
    {
        if( is_prime[ i ] )
        {
            for( ll j = 2 * i; j <= N; j += i )
            {
                is_prime[ j ] = false;
            }
            P.emplace_back( i );
        }
    }
    return P;
}

int main() {
    int n, m, k, T;
    cin >> n >> m >> k >> T;
    ll dp[n][m][2 * (n + m)]; // dp[i][j][k]... マス(i, j),time=k-(n+m)
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int k = 0; k < 2 * (n + m); k++) {
                dp[i][j][k] = (ll)1e18;
            }
        }
    }
    ll t[n][m];
    ll f[n][m];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            t[i][j] = 0;
            f[i][j] = 0;
        }
    }
    for (int i = 1; i <= k; i++) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        a--;
        b--;
        t[a][b] = c;
        f[a][b] = d;
    }
    dp[0][0][n + m] = 0;
    min_priority_queue<tuple<ll, int, int, ll>> que; // fatigue, i,j,t
    que.push({0, 0, 0, n + m});
    int dx[4] = {1, -1, 0, 0};
    int dy[4] = {0, 0, 1, -1};
    while (que.size()) {
        auto p = que.top();
        que.pop();
        int cx = get<1>(p);
        int cy = get<2>(p);
        ll cf = get<0>(p);
        ll ct = get<3>(p);
        // cout << cx << ' ' << cy << ' ' << cf << ' ' << ct << '\n';
        // 止まる
        ll nf = cf + f[cx][cy];
        ll nt = max((ll)0, ct + 1 - t[cx][cy]);
        if ((nt < 2 * (n + m)) && (dp[cx][cy][nt] > nf)) {
            dp[cx][cy][nt] = nf;
            que.push({nf, cx, cy, nt});
        }
        // 動く
        for (int i = 0; i < 4; i++) {
            int nx = cx + dx[i];
            int ny = cy + dy[i];
            ll nt = ct + 1;
            ll nf = cf;
            if ((0 <= nx) && (nx < n) && (0 <= ny) && (ny < m) && (nt < 2 * (n + m)) && (dp[nx][ny][nt] > nf)) {
                dp[nx][ny][nt] = nf;
                que.push({nf, nx, ny, nt});
            }
        }
    }
    ll ans = (ll)1e18;
    for (ll i = 0; i <= min(T + n + m, 2 * (n + m) - 1); i++) {
        ans = min(ans, dp[n - 1][m - 1][i]);
    }
    if (ans == (ll)1e18) {
        cout << -1 << endl;
    }
    else {
        cout << ans << endl;
    }
    return 0;
}