#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <assert.h>

using namespace std;
typedef long long ll;
typedef set<int>::iterator ssii;

#define Cmp(a, b) memcmp(a, b, sizeof(b))
#define Cpy(a, b) memcpy(a, b, sizeof(b))
#define Set(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define _forS(i, l, r) for(set<int>::iterator i = (l); i != (r); i++)
#define _rep(i, l, r) for(int i = (l); i <= (r); i++)
#define _for(i, l, r) for(int i = (l); i < (r); i++)
#define _forDown(i, l, r) for(int i = (l); i >= r; i--)
#define debug_(ch, i) printf(#ch"[%d]: %d\n", i, ch[i])
#define debug_m(mp, p) printf(#mp"[%d]: %d\n", p->first, p->second)
#define debugS(str) cout << "dbg: " << str << endl;
#define debugArr(arr, x, y) _for(i, 0, x) { _for(j, 0, y) printf("%c", arr[i][j]); printf("\n"); }
#define _forPlus(i, l, d, r) for(int i = (l); i + d < (r); i++)
#define lowbit(i) (i & (-i))
#define MPR(a, b) make_pair(a, b)

pair<int, int> crack(int n) {
    int st = sqrt(n);
    int fac = n / st;
    while (n % st) {
        st += 1;
        fac = n / st;
    }

    return make_pair(st, fac);
}

inline ll qpow(ll a, int n) {
    ll ans = 1;
    for(; n; n >>= 1) {
        if(n & 1) ans *= 1ll * a;
        a *= a;
    }
    return ans;
}

template <class T>
inline bool chmax(T& a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmin(T& a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

// ============================================================== //

const int maxn = 2000 + 5;
const int maxm = 50 + 5;
int maxp, n, w;
int ap[maxn], as[maxn], bp[maxn], bs[maxn];
const int inf = 0x3f3f3f3f;

ll f[maxn][maxn], pre[maxn];
ll que[maxn];

inline ll calc(ll k, ll v) {
    return pre[k] + 1ll * k * v;
}

void dp() {
    memset(f, -inf, sizeof(f));
    memset(pre, -inf, sizeof(pre));
    memset(que, 0, sizeof(que));
    pre[0] = 0;

    _rep(i, 1, n) {
        _rep(k, 0, maxp) if(i > w+1) chmax(pre[k], f[i-w-1][k]);

        int l = 1, r = 0;
        _rep(j, 0, maxp) {
            while (l <= r && que[l] < j - as[i]) l++;
            if(l <= r) chmax(f[i][j], -j*ap[i] + calc(que[l], ap[i]));
            while (l <= r && calc(que[r], ap[i]) <= calc(j, ap[i])) r--;
            que[++r] = j;
        }

        l = 1, r = 0;
        _forDown(j, maxp, 0) {
            while (l <= r && que[l] > j + bs[i]) l++;
            if(l <= r) chmax(f[i][j], -j*bp[i] + calc(que[l], bp[i]));
            while (l <= r && calc(que[r], bp[i]) <= calc(j, bp[i])) r--;
            que[++r] = j;
        }
        _rep(j, 0, maxp) chmax(f[i][j], f[i-1][j]);
    }
}

void init() {
    //
}

int main() {
    freopen("input.txt", "r", stdin);
    init();
    // get data
    cin >> n >> maxp >> w;
    _rep(i, 1, n) {
        scanf("%d%d%d%d", &ap[i], &bp[i], &as[i], &bs[i]);
    }

    // then dp
    dp();
    ll ans = 0;
    _rep(j, 0, maxp) chmax(ans, f[n][j]);
    printf("%lld\n", ans);
}