// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 3005;

const LL INF = 0x3f3f3f3f;

int n, T, U[N], V[N], D[N], E[N];

LL f[N][N];

int main() {
    read(n), read(T);
    memset(f, 0x3f, sizeof f);
    f[0][0] = 0;
    for (int i = 1; i <= n; i++) read(U[i]), read(V[i]), read(D[i]), read(E[i]);
    for (int i = 1; i <= n; i++) {
    	for (int j = 0; j <= n; j++) chkMin(f[i][j], f[i - 1][j] + j * T * 2 + (j ? min(U[i] + V[i], E[i] + D[i]) : U[i] + V[i]));
    	LL w = INF;
    	for (int j = 0; j <= n; j++) {
    		chkMin(f[i][j], w + j * T * 2 + j * (D[i] + V[i]));
    		chkMin(w, f[i - 1][j] - j * (D[i] + V[i]));
    	}
    	w = INF;
    	for (int j = n; j >= 0; j--) {
    		chkMin(f[i][j], w + j * T * 2 - j * (U[i] + E[i]));
    		chkMin(w, f[i - 1][j] + j * (U[i] + E[i]));
    	}
    	
    }
    printf("%lld\n", f[n][0] + (n + 1ll) * T);
    return 0;
}