#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,pair<int,int>>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,-1,0,1 };
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k, t; cin >> n >> m >> k >> t;
	vector a(n, vector<int>(m));
	vector b(n, vector<int>(m));
	rep(i, k) {
		int s, t; cin >> s >> t;
		s--, t--;
		cin >> a[s][t] >> b[s][t];
	}
	int x = n + m - 2;
	//[-x,x]->[0,2x]
	vector dp(n, vector(m, vector<long long>(2 * x + 1, LINF)));
	dp[0][0][x] = 0;
	using tup = tuple<int, int, int>;
	using tp = pair<long long, tup>;
	priority_queue<tp, vector<tp>, greater<tp>> q;
	q.push({ 0, {0,0,x} });
	while (!q.empty()) {
		auto tmp = q.top();
		q.pop();
		long long cost = tmp.first;
		auto[s, t, u] = tmp.second;
		if (cost > dp[s][t][u]) continue;
		if (u != 2 * x) {
			rep(i, 4) {
				int ns = s + dx[i];
				int nt = t + dy[i];
				if ((0 <= ns) && (n > ns) && (0 <= nt) && (m > nt)) {
					if (chmin(dp[ns][nt][u + 1], dp[s][t][u])) q.push({ dp[ns][nt][u + 1], {ns,nt,u + 1} });
				}
			}
		}
		if (a[s][t]) {
			int nu = max(0, u + 1 - a[s][t]);
			if (chmin(dp[s][t][nu], dp[s][t][u] + b[s][t]))q.push({ dp[s][t][nu], {s,t,nu} });
		}
	}
	long long ans = LINF;
	rep(i, min(t + x, 2 * x) + 1) chmin(ans, dp[n - 1][m - 1][i]);
	if (LINF == ans)ans = -1;
	cout << ans << endl;
	return 0;
}