#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
  gn(x1), gn(x2), gn(x3);
}
template <class T1, class T2, class T3, class T4>
inline void gn(T1 &x1, T2 &x2, T3 &x3, T4 &x4) {
  gn(x1), gn(x2), gn(x3), gn(x4);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
template <class T1, class T2, class T3, class T4>
inline void print(T1 x1, T2 x2, T3 x3, T4 x4) {
  printsp(x1), printsp(x2), printsp(x3), println(x4);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int val[200010], flag[200010], dist[200010], pre[200010];
vector<pair<int, int> > adj[200010];
int id[200010], di[200010];
bool cmp(int u, int v) { return val[u] < val[v]; }
void update(int u, int v) {
  int len = val[v] - val[u];
  adj[u].push_back(pair<int, int>(v, len));
  adj[v].push_back(pair<int, int>(u, len));
}
priority_queue<pair<int, int>, vector<pair<int, int> >,
               greater<pair<int, int> > >
    q;
queue<int> qq;
int ans[200010], N;
int main() {
  int n, L;
  gn(n, L);
  int nn = 1;
  val[nn++] = L;
  for (int i = 1; i <= n; i++) {
    int first, d, t, p;
    gn(first, d, t, p);
    int u = first - p, v = first + d, w = t + p;
    if (u >= 0 and t < d) {
      di[nn] = i;
      di[nn + 1] = i;
      adj[nn].push_back(pair<int, int>(nn + 1, w));
      val[nn++] = u;
      val[nn++] = v;
    }
  }
  for (int i = 0; i < nn; i++) {
    id[i] = i;
    dist[i] = 0x3f3f3f3f;
  }
  dist[0] = 0;
  sort(id, id + nn, cmp);
  for (int i = 1; i < nn; i++) {
    update(id[i - 1], id[i]);
  }
  q.push(pair<int, int>(0, 0));
  while (!q.empty()) {
    int u = q.top().second;
    q.pop();
    for (int i = 0; i < adj[u].size(); i++) {
      int v = adj[u][i].first, w = adj[u][i].second;
      if (dist[v] > dist[u] + w) {
        pre[v] = u;
        dist[v] = dist[u] + w;
        q.push(pair<int, int>(dist[v], v));
      }
    }
  }
  qq.push(1);
  while (!qq.empty()) {
    int v = qq.front();
    qq.pop();
    int u = pre[v];
    if (u == 0) break;
    int uu = di[u], vv = di[v];
    if (uu == vv) ans[N++] = uu;
    qq.push(u);
  }
  println(dist[1]);
  println(N);
  for (int i = N; i--;) {
    printsp(ans[i]);
  }
}
