#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 2e5 + 7 ;

int n , lim ;
struct node {
    int t , sz , prior ;
    int id ;
};
node a[ MAXN ] ;
vector < node > v ;

priority_queue < pair < long double , int > > q ;
long double ans[ MAXN ] ;

long double x ;
int pos ;
ll sm ;
long double tot_decrease ;

void add_elem ( ) {
    if ( sm > 0 ) { 
        long double add = ( v[ pos ].t - x ) ;
        add *= lim ;
        add /= sm ;
        tot_decrease += add ;
    }
    x = v[ pos ].t ;
    long double aux = v[ pos ].sz ;
    sm += v[ pos ].prior ;
    aux /= v[ pos ].prior ;
    q.push ( { - ( aux + tot_decrease ) , v[ pos ].id } ) ;
    ++ pos ;
}

long double time_to_kill ( ) {
    if ( q.empty ( ) == true ) { return 0.0 ; }
    int wh = q.top ( ).se ;

    long double lft = -q.top ( ).fi - tot_decrease ;
    long double coef = 1.0 ;
    coef /= sm ;
    coef *= lim ;
    return ( lft / coef ) ;
}

void solve ( ) {
    cin >> n >> lim ;
    v.resize ( n ) ;
    for ( int i = 0 ; i < n ; ++ i ) {
        cin >> v[ i ].t >> v[ i ].sz >> v[ i ].prior ;
        v[ i ].id = i ;
        a[ i ] = v[ i ] ;
    }
    auto cmp = [ & ] ( node p1 , node p2 ) {
        return ( p1.t < p2.t ) ;
    };
    sort ( v.begin ( ) , v.end ( ) , cmp ) ;
    while ( 1 ) {
        if ( pos == n && q.empty ( ) == true ) { break ; }
        if ( sm == 0 ) { add_elem ( ) ; }
        else {
            if ( pos == n ) {
                while ( q.empty ( ) == false ) {
                    long double sr = time_to_kill ( ) ;
                    ans[ q.top ( ).se ] = x + sr ;
                    tot_decrease += ( sr * lim ) / sm ;
                    sm -= a[ q.top ( ).se ].prior ;
                    q.pop ( ) ;
                    x += sr ;
                }
            }
            else {
                while ( pos < n ) {
                    long double mx = v[ pos ].t - x ;
                    long double sr = time_to_kill ( ) ;
                    if ( sm > 0 && sr < mx ) {
                        ans[ q.top ( ).se ] = x + sr ;
                        tot_decrease += ( sr * lim ) / sm ;
                        sm -= a[ q.top ( ).se ].prior ;
                        q.pop ( ) ;
                        x += sr ;
                    }
                    else {
                        add_elem ( ) ;
                    }
                }
            }
        }
    }
    for ( int i = 0 ; i < n ; ++ i ) {
        cout << fixed << setprecision ( 12 ) << ans[ i ] << "\n" ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}