// –Í‹[’n‹æ—\‘I2010 I. Operator

#include <iostream>
#include <vector>

using namespace std;

bool simulate(const vector<int> &L, const vector< pair<int, int> > &vp, int T, int M){
	int N = vp.size();
	vector<int> lest(T+1, 0);
	vector<bool> ok(vp.size(), false);
	for(int i=0;i<M;i++) lest[L[i]]++;
	int cnt = N-M;
	for(int i=1;i<T;i++){
		if(cnt == 0) return true;
		if(lest[i]==0) continue;
		for(int j=M;j<N;j++){
			if(ok[j]) continue;
			if(i%vp[j].second <= vp[j].first){
				if(i+L[j] > T) return false;
				cnt--;
				ok[j] = true;
				lest[i]--;
				lest[i+L[j]]++; 
			}
			if(lest[i] == 0) break;
		}
		lest[i+1] += lest[i];
	}
	return cnt == 0;
}

int main(){
	int N, T;
	while(cin >> N >> T, N){
		vector<int> L(N);
		vector< pair<int, int> > vp(N);
		for(int i=0;i<N;i++){
			cin >> L[i] >> vp[i].first >> vp[i].second;
			vp[i].second += vp[i].first;
		}
		for(int i=1;i<=N;i++){
			if(simulate(L, vp, T, i)){
				cout << i << endl; break;
			}
		}
	}
}