D.cpp

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

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

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define inf (1LL << 61)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define for0(i, stop) for(ll i = 0; i < stop; ++i)
#define rep1(i, start) for(ll i = start; i >= 1; --i)
#define rep0(i, start) for(ll i = (start-1); i >= 0; --i)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

// === Debug macro starts here ===
#ifndef ONLINE_JUDGE
#define DEBUG
#define SYS_COL system("COLOR")
#endif

int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) {++recur_depth; auto x_=x; --recur_depth; SYS_COL; cerr<<string(recur_depth, '\t')<<"\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<#x<<" = "<<x_<<"\e[39m"<<endl;}
#else
#define dbg(x)
#endif
template<typename Ostream, typename Cont>
typename enable_if<is_same<Ostream,ostream>::value, Ostream&>::type operator<<(Ostream& os,  const Cont& v){
	os<<"[";
	for(auto& x:v){os<<x<<", ";}
	return os<<"]";
}
template<typename Ostream, typename ...Ts>
Ostream& operator<<(Ostream& os,  const pair<Ts...>& p){
	return os<<"{"<<p.first<<", "<<p.second<<"}";
}
// === Debug macro ends here ===

#define ff first
#define ss second

const ll sz = 1e5 + 10, num = 1e5;
ll lev[sz], pos[sz], enq[sz];

struct info {
    ll t, x, y;
} ara[205];

int main()
{
    ll n, m;
    cin >> n >> m;

    for1(i, n) {
        sl(ara[i].t), sl(ara[i].x), sl(ara[i].y);

        //ara[i].x = ara[i].x/num + (ara[i].x%num != 0);
        //dbg(ara[i].x);
    }

    queue <ll> q;
    q.push(0);
    enq[0] = 1;

    while(!q.empty()) {
        ll u = q.front();
        q.pop();
        enq[u] = 0;

        pos[u]++;
        ll id = pos[u];
        if(id > n)
            continue;

        for(ll i = 0; i <= ara[id].y; i++) {

            if(u > m || enq[u]) break;

            q.push(u);
            enq[u] = 1;

            if(pos[u] == 0) lev[u] = pos[u] = id;

            if(ara[id].t == 1) {
                ll ad = ara[id].x/num + (ara[id].x%num != 0);
                u += ad;
            }
            else {
                u = u*ara[id].x;
                u = u/num + (u%num != 0);
            }

            //dbg(u);
        }
    }

    for1(i, m)
        pf("%lld ", (ll)(lev[i]==0)? -1 : lev[i]);

    pn;

    return 0;
}