#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
int n, t, u[3005], v[3005], d[3005], f[3005];
lint cst[3005], pfx[3005];
lint cost(int s, int e){
lint ret = 3ll * (e - s) * t + u[e] + f[e];
if(s < e) ret += cst[e-1] - cst[s];
lint tmp = 2ll * s * t + pfx[s];
if(s != e) tmp += min(u[s] + v[s], d[s] + f[s]);
tmp = min(tmp, 1ll * d[s] + v[s]);
return ret + tmp;
}
lint dp[3005];
int main(){
cin >> n >> t;
pfx[0] = 1e18;
for(int i=1; i<=n; i++){
cin >> u[i] >> v[i] >> d[i] >> f[i];
cst[i] = cst[i-1] + min(u[i] + v[i], d[i] + f[i]);
pfx[i] = min(pfx[i-1], d[i] + v[i] - 2ll * i * t);
}
for(int i=1; i<=n; i++){
dp[i] = dp[i-1] + u[i] + v[i] + t;
for(int j=0; j<i; j++){
dp[i] = min(dp[i], dp[j] + t + cost(j+1, i));
}
}
cout << dp[n] + t;
}
