#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

template<typename T>
class Compress{
    public:
    vector<T> data;
    int offset;
    Compress(vector<T> data_, int offset=0): offset(offset){
        data = data_;
        sort(begin(data), end(data));
        data.erase(unique(begin(data), end(data)), end(data));
    };
    int operator[](T x) {
        auto p = lower_bound(data.begin(), data.end(), x);
        assert(x == *p);
        return offset+(p-data.begin());
	}
    T inv(int x){
        return data[x-offset];
    }
    int size(){
        return data.size();
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; ll m; cin >> n >> m;
    vector<ll> x(n), y(n), h(n);
    for(int i = 0; i < n; i++) {
        ll X, Y; cin >> X >> Y >> h[i];
        x[i] = X+Y;
        y[i] = X-Y;
    }
    vector<ll> vx = x;
    vector<ll> vy = y;
    for(int i = 0; i < n; i++){
        vx.push_back(x[i]-(m-h[i]));
        vx.push_back(x[i]+(m-h[i]));
        vy.push_back(y[i]-(m-h[i]));
        vy.push_back(y[i]+(m-h[i]));
    }
    auto cpx = Compress<ll>(vx);
    auto cpy = Compress<ll>(vy);
    auto imos = vec2d(cpx.size(), cpy.size(), 0);
    for(int i = 0; i < n; i++){
        int i0 = cpx[x[i]-(m-h[i])];
        int i1 = cpx[x[i]+(m-h[i])];
        int j0 = cpy[y[i]-(m-h[i])];
        int j1 = cpy[y[i]+(m-h[i])];
        imos[i0][j0]++;
        imos[i0][j1]--;
        imos[i1][j0]--;
        imos[i1][j1]++;
    }
    for(int i = 1; i < cpx.size(); i++){
        for(int j = 0; j < cpy.size(); j++){
            imos[i][j] += imos[i-1][j];
        }
    }
    for(int i = 0; i < cpx.size(); i++){
        for(int j = 1; j < cpy.size(); j++){
            imos[i][j] += imos[i][j-1];
        }
    }
    vector<mint> ans(n+1);
    for(int i = 0; i+1 < cpx.size(); i++){
        for(int j = 0; j+1 < cpy.size(); j++){
            ll x = cpx.data[i+1]-cpx.data[i];
            ll y = cpy.data[j+1]-cpy.data[j];
            ans[imos[i][j]] += mint(x)*mint(y);
        }
    }
    for(int i = 1; i <= n; i++) cout << ans[i]/2 << endl;
}