#include <bits/stdc++.h>
#include <atcoder/all>
// url 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double lld;
using namespace std;
using namespace atcoder;
using mint = static_modint<998244353>;
const ll mod=998244353;
// using mint = static_modint<1000000007>;
//const ll mod=1e9+7;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const string zton="0123456789";
const string atoz="abcdefghijklmnopqrstuvwxyz";
const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ll inf=(1ll<<60);
// const int inf=(1<<30);
lld dist(lld x1,lld x2,lld y1,lld y2){
    lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    res=sqrt(abs(res));
    return res;
}
lld arg(lld x,lld y){
    const lld eps=1e-8;
    lld res=0;
    if(abs(x)+abs(y)<=eps)return 0.0;
    else if(abs(x)<=eps){
        if(y>=0.0)return (M_PI/2);
        else return (M_PI/2+M_PI);
    }
    else if(abs(y)<=eps){
        if(x>=0.0)return 0.0;
        else return M_PI;
    }
    res=atan2(abs(y),abs(x));
    if(x<=0&&y>=0)res=(M_PI-res);
    else if(x<=0&&y<=0)res+=(M_PI);
    else if(x>=0&&y<=0)res=(M_PI*2-res);
    return res;
}
ll gcd(ll a,ll b){
    if(a==0||b==0)return a+b;
    ll r;
    r=a%b;
    if(r==0){
        return b;
    }
    else{
        return gcd(b,r);
    }
}
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}
__int128 parse128(string &s) {
    __int128 ret = 0;
    for (int i = 0; i < s.length(); i++){
        if ('0' <= s[i] && s[i] <= '9'){
            ret = 10 * ret + s[i] - '0';
        }
    }
    return ret;
}
using l3 = __int128;

bool comp_arg(pair<ll,ll> a,pair<ll,ll> b){
    if(a.second>=0&&b.second<0)return true;
    else if(a.second<0&&b.second>=0)return false;
    if(a.second>=0&&b.second>=0){
        if(a.first>=0&&b.first<0)return true;
    }
    else{
        if(a.first>=0&&b.first<0)return false;
    }
    ll det=a.first*b.second-a.second*b.first;
    if(det>0)return true;
    return false;
}

typedef pair<ll,int> P;

int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;ll M;cin >> N >> M;
    ll X[N],Y[N],H[N];
    set<ll> st;
    rep(i,0,N){
        cin >> X[i] >> Y[i] >> H[i];
        X[i]*=2;
        Y[i]*=2;
        H[i]*=2;
        if(H[i]>=M*2)continue;
        ll d=M*2-H[i];
        rep(k,0,4){
            ll nx=X[i]+d*dx[k],ny=Y[i]+d*dy[k];
            ll nxx=nx-ny,nxy=nx+ny;
            st.insert(nxx);
            st.insert(nxy);
        }
    }
    st.insert(-inf);st.insert(inf);
    st.insert(-inf-1);st.insert(inf-1);
    int K=st.size();
    map<ll,int> mp;
    vector<ll> inv;
    for(auto x:st){
        mp[x]=mp.size();
        inv.pb(x);
    }
    ll cnt[K][K];rep(i,0,K)rep(j,0,K)cnt[i][j]=0;
    rep(i,0,N){
        if(H[i]>=M*2)continue;
        ll d=M*2-H[i];
        ll x0=(X[i]+d*dx[0]),y0=(Y[i]+d*dy[0]);
        ll x1=(X[i]+d*dx[1]),y1=(Y[i]+d*dy[1]);
        ll x2=(X[i]+d*dx[2]),y2=(Y[i]+d*dy[2]);
        ll x3=(X[i]+d*dx[3]),y3=(Y[i]+d*dy[3]);
        ll nx0=mp[x0-y0],ny0=mp[x0+y0];
        ll nx1=mp[x1-y1],ny1=mp[x1+y1];
        ll nx2=mp[x2-y2],ny2=mp[x2+y2];
        ll nx3=mp[x3-y3],ny3=mp[x3+y3];
        cnt[nx2][ny2]++;
        cnt[nx3][ny3]--;
        cnt[nx0][ny0]++;
        cnt[nx1][ny1]--;
    }
    rep(i,0,K-1)rep(j,0,K)cnt[i+1][j]+=cnt[i][j];
    rep(i,0,K)rep(j,0,K-1)cnt[i][j+1]+=cnt[i][j];
    vector<ll> ans(N+1,0);
    rep(i,0,K-1)rep(j,0,K-1){
        ll h=inv[i+1]-inv[i];
        ll w=inv[j+1]-inv[j];
        if(cnt[i][j]==0)continue;
        h%=mod;w%=mod;
        ans[cnt[i][j]]+=(h*w)%mod;
        ans[cnt[i][j]]%=mod;
    }
    rep(i,1,N+1){
        mint res=ans[i];
        res/=8;
        cout << res.val() << endl;
    }
}