#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#define ll long long
#define mod (ll)(1e9+7)
using namespace std;
 
ll t,n,m,a[2000005];
ll ti,yi;
double xi;
 
int main()
{
	//freopen("1.in","r",stdin);
	cin>>n>>m;
	for (int i=1; i<=n; i++)
	{
		cin>>ti>>xi>>yi;
		
		for (int k=m; k>=0; k--)
		if (a[k] || k==0)
		{
			ll x=(ll)(k);
			for (int j=1; j<=yi; j++)
			{
				if (ti==2 && x==0) break; 
				if (ti==1) x= (x*1e5 + xi + 1e5 -1 ) / 1e5 ; 
					else x= (x*xi + 1e5 -1) / 1e5;
				//x=ceil(x);
				if (x>m || a[(int)x]) break;
				else 
				a[(int)x]=i;
			}
			x/=(1e5);
		}
	}
	for (int i=1; i<=m; i++)
		printf("%lld ", a[i] ? a[i] : -1);
	return 0;
}


