import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;

alias Data = Tuple!(int, "b", int, "l", int, "u");

void main() {
    int n, x;
    scan(n, x);

    auto ds = new Data[](n);

    long v;

    foreach (i ; 0 .. n) {
        int bi, li, ui;
        scan(bi, li, ui);
        ds[i] = Data(bi, li, ui);
        v += 1L * bi * li;
    }

    ds.sort!((a, b) => 1L * a.l * a.b + 1L * a.u * (x - a.b) > 
                        1L * b.l * b.b + 1L * b.u * (x - b.b));

    debug {
        writefln("%(%s\n%)", ds);
    }

    long ans;
    int p = -1;

    foreach (i ; 0 .. n) {
        auto plus = 1L * ds[i].l * ds[i].b + 1L * ds[i].u * (x - ds[i].b);
        if (v < plus) {
            p = i;
            break;
        }
        else {
            ans += x;
            v -= plus;
        }
    }

    debug {
        writeln("rem v:", v);
    }

    long mic = inf3;

    foreach (i ; p .. n) {
        auto bi = ds[i].b;
        auto li = ds[i].l;
        auto ui = ds[i].u;
        long t;
        debug {
            writeln(bi, " ", li, " ", ui);
        }
        if (1L * bi * li >= v) {
            t = (v + li - 1) / li;
        }
        else {
            long vv = v - 1L * bi * li;
            t = bi + (vv + ui - 1) / ui;
        }
        debug {
            writeln("t:", t);
        }
        mic = min(mic, t);
    }

    ans += mic;
    writeln(ans);
}























int[][] readGraph(int n, int m, bool isUndirected = true, bool is1indexed = true) {
    auto adj = new int[][](n, 0);

    foreach (i; 0 .. m) {
        int u, v;
        scan(u, v);
        if (is1indexed) {
            u--, v--;
        }
        adj[u] ~= v;
        if (isUndirected) {
            adj[v] ~= u;
        }
    }

    return adj;
}

alias Edge = Tuple!(int, "to", int, "cost");

Edge[][] readWeightedGraph(int n, int m, bool isUndirected = true, bool is1indexed = true) {
    auto adj = new Edge[][](n, 0);

    foreach (i; 0 .. m) {
        int u, v, c;
        scan(u, v, c);
        if (is1indexed) {
            u--, v--;
        }
        adj[u] ~= Edge(v, c);
        if (isUndirected) {
            adj[v] ~= Edge(u, c);
        }
    }

    return adj;
}

void yes(bool b) {
    writeln(b ? "Yes" : "No");
}

void YES(bool b) {
    writeln(b ? "YES" : "NO");
}

T[] readArr(T)() {
    return readln.split.to!(T[]);
}

T[] readArrByLines(T)(int n) {
    return iota(n).map!(i => readln.chomp.to!T).array;
}

void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}
