#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<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; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k, t; cin >> n >> m >> k >> t;
	vector <long long> a(k), b(k), c(k), d(k);
	rep(i, k) {
		cin >> a[i] >> b[i] >> c[i] >> d[i];
		a[i]--, b[i]--;
	}
	if (n + m - 2 <= t) {
		cout << 0 << endl;
		return 0;
	}
	long long mx = n + m - 2 - t;
	vector dp(k + 1, vector<long long>(mx + 1, LINF));
	dp[0][0] = 0;
	rep(i, k) {
		int x = c[i] - 1;
		if (0 == x) {
			rep(j, mx + 1) {
				dp[i + 1][j] = dp[i][j];
			}
			continue;
		}
		for (long long j = 0; ; ++j) {//回数
			long long k = j * x;
			rep(l, mx + 1) {
				int nj = min(mx, j + k);
				chmin(dp[i + 1][nj], dp[i][l] + d[i] * j);
			}
			if (k > mx)break;
		}
	}
	if (LINF == dp[k][mx])dp[k][mx] = -1;
	cout << dp[k][mx] << endl;
	return 0;
}