#include <bits/stdc++.h>
using namespace std;

template<typename T>
struct Segtree {
    int n, n_org;
    T e;
    vector<T> dat;
    typedef function<T(T a, T b)> Func;
    Func f;

    Segtree(){}
    Segtree(int n_input, Func f_input, T e_input){
        initialize(n_input, f_input, e_input);
    }
    void initialize(int n_input, Func f_input, T e_input){
        n_org = n_input;
        f = f_input;
        e = e_input;
        n = 1;
        while(n < n_input) n <<= 1;
        dat.resize(2*n-1, e);
    }

    void build(vector<T>& A){
        for(int k=0; k<int(A.size()); k++) dat[k+n-1] = A[k];
        for(int k=n-2; k>=0; k--) dat[k] = f(dat[2*k+1], dat[2*k+2]);
    }

    void update(int k, T a){
        k += n - 1;
        dat[k] = a;
        while(k > 0){
            k = (k - 1)/2;
            dat[k] = f(dat[2*k+1], dat[2*k+2]);
        }
    }

    T get(int k){
        return dat[k+n-1];
    }

    T between(int a, int b){
        return query(a, b+1, 0, 0, n);
    }

    T query(int a, int b, int k, int l, int r){
        if(r<=a || b<=l) return e;
        if(a<=l && r<=b) return dat[k];
        T vl = query(a, b, 2*k+1, l, (l+r)/2);
        T vr = query(a, b, 2*k+2, (l+r)/2, r);
        return f(vl, vr);
    }
};

int main(){
    int N;
    cin >> N;
    vector<int> A(N), B(N), C(N), D(N);
    // {pos, c, i}
    // c : Aなら0, Dなら1
    vector<vector<int>> X;
    for(int i=0; i<N; i++){
        cin >> A[i] >> B[i] >> C[i];
        D[i] = B[i] - C[i];
        X.push_back({A[i], 0, i});
        X.push_back({D[i], 1, i});
    }
    sort(X.begin(), X.end());
    bitset<100000> inf, a_done, d_done;
    multiset<int> st;
    st.insert(2e9);
    bool inf_now = false;
    for(auto& v : X){
        int t = v[1], i = v[2];
        if(t == 0){
            if(D[i] >= *st.begin()){
                inf_now = true;
            }
            a_done[i] = 1;
            if(!d_done[i]) st.insert(A[i]);
        }else{
            if(inf_now) inf[i] = 1;
            d_done[i] = 1;
            if(a_done[i]) st.erase(st.lower_bound(A[i]));
        }
    }

    vector<int> apos(N), dpos(N);
    for(int i=0; i<2*N; i++){
        if(X[i][1] == 0){
            apos[X[i][2]] = i;
        }else{
            dpos[X[i][2]] = i;
        }
    }

    Segtree<int64_t> segt(2*N, [](auto a, auto b){ return max(a, b); }, 0);

    vector<int64_t> ans(N, -1);
    for(int i=0; i<N; i++) if(inf[i]) ans[i] = 1e18;
    for(auto& v : X){
        int i = v[2];
        if(ans[i] == -1){
            ans[i] = B[i] + segt.between(0, dpos[i]);
            if(ans[i] > 1e18) ans[i] = 1e18;
        }
        segt.update(apos[i], ans[i]);
    }
    for(int i=0; i<N; i++){
        if(ans[i] == 1e18){
            cout << "BAN" << endl;
        }else{
            cout << ans[i] << endl;
        }
    }
    return 0;
}