#include <bits/stdc++.h>
#define ent '\n'
#define int long long

using namespace std;
typedef long long ll;

const int maxn = 1e6 + 12;
const int mod = 998244353;

int t[maxn], p[maxn], c[maxn];
int n, m, k;

void solve() {
    cin >> n >> k;
    for(int _ = 1; _ <= n; _++) {
        cin >> t[_] >> p[_] >> c[_];
        vector<pair<int, int>> a, b;
        for(int i = 1; i <= _; i++) {
            if(t[i] == 1) {
                a.push_back({p[i], c[i]});
            }
            else {
                b.push_back({p[i], c[i]});
            }
        }
        sort(a.begin(), a.end());
        sort(b.begin(), b.end());
        int ans = 0;
        for(int i = 0, j = 0; i < a.size(); i++) {
            while(j < b.size() && a[i].first - b[j].first > k) {
                j++;
            }
            while(j < b.size() && b[j].first - a[i].first <= k && a[i].second > 0) {
                int t = min(a[i].second, b[j].second);
                a[i].second -= t, b[j].second -= t;
                ans += t;
                if(b[j].second == 0) {
                    j++;
                }
            }
        }
        cout << ans << ent;
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
//    cin >> t;

    while(t--) {
        solve();
    }
}