#include <iostream>
#include<algorithm>
#include<ifstream>
using namespace std;
int D(10000), T(100000), S(100000000);
int main()
{int n, m, i;
cin>>n>>m;
ifstream f{"date.in"}
ifstream g{"date.out"}
for(i=1; i<=n; i++)
{
    f>>D(i)>>T>>(i);}
    for(i=1; i<=n; i++)
    {
        S(i)=D(i)+T(i);
        sort(D+1; S+n+1)
    }
    for(i=1; i<=n; i++)
    {
        if(S<=m) m=m-S;
    }
    g<<m;
}
}