boxes2019

#include <iostream>
#include <cmath>
#define INF 1e8
using namespace std;
int main() {
    long long a,vol;
    cin>>a>>vol;
    bool o=0;
    long long x[a];
    long long y[a];
    long long z[a];
    long long f[a+1][vol+1];
    for(int k1=0;k1<a;k1++){
        cin>>x[k1];
        cin>>y[k1];
        cin>>z[k1];
    }
    long long maxd=INF;
    long long d=0;
    long long maxdi;
    bool b=0;
    for(int i=0;i<=a;i++){
        for(int j=0;j<=vol;j++){
                f[i][j] = INF;
                maxd = min(x[i-1],z[i-1]);
                maxd = min(maxd,y[i-1]);
                maxdi = -maxd;
                maxdi++;
                d=0;
                b=0;
                if(i == 0 && j == 0){
                    f[i][j] = 0;
                }
                else if(i == 0 || j == 0){
                    f[i][j] = INF;
                }
            else{
                while(d >= maxdi && (x[i-1] + d) * (y[i-1] + d) * (z[i-1] + d) <= vol){
                        if(j -((x[i-1] + d) * (y[i-1] + d) * (z[i-1] + d)) >= 0 && j -((x[i-1] + d) * (y[i-1] + d) * (z[i-1] + d)) <= vol){
                            f[i][j] = min(f[i][j],abs(d)+f[i-1][j -((x[i-1] + d) * (y[i-1] + d) * (z[i-1] + d))]);
                        }
                        else{
                            f[i][j] = INF;
                        }
                    if(f[i][j] >= INF){
                        f[i][j] = INF;
                    }
                    if(b == 0){
                        d--;
                        if(d == maxdi - 1){
                            b=1;
                            b++;
                        }
                    }
                    if(b == 1){
                        d++;
                    }
                }
            }
        }
    }
    /*
    for(int i=0;i<=a;i++){
        for(int j=0;j<=vol;j++){
            cout<<i<<" "<<j<<" "<<f[i][j]<<endl;
        }
    }
    */
    if(f[a][vol] < INF){
        cout<<f[a][vol];
    }
    else{
        cout<<-1;
    }
    return 0;
}