class Heap
	require 'forwardable'
	extend Forwardable

	def initialize
		@array = []
		@index = {}
	end

	def add(obj, key)
		@array << [obj, key]
		@index[obj] = @array.size - 1
		lift_up(@array.size - 1)
	end

	def swap(i, j)
		u = @array[i]
		v = @array[j]
		@index[u[0]], @index[v[0]] = j, i
		@array[i], @array[j] = v, u
	end

	def lift_up(i)
		return if i == 0
		j = (i - 1) / 2
		if (@array[i][1] <=> @array[j][1]) < 0
			swap(i, j)
			lift_up(j)
		end
	end

	def del_min
		raise "heap is empty!" if empty?
		min = @array[0]
		if size > 1
			swap(0, @array.size-1)
			@array.pop
			lift_down(0)
		else
			@array.pop
		end
		@index.delete(min[0])
		min
	end

	def inc_key(obj, diff)
		i = @index[obj]
		@array[i][1] += diff
		lift_down(i)
	end

	def dec_key(obj, diff)
		i = @index[obj]
		@array[i][1] -= diff
		lift_up(i)
	end

	def del(obj)
		dec_key(obj, Float::INFINITY)
		del_min
	end

	def update_key(obj, new_key)
		i = @index[obj]
		return unless i
		return if (new_key <=> @array[i][1]) >= 0
		@array[i][1] = new_key
		lift_up(i)
	end

	def min_obj
		@array[0][0]
	end

	def min_key
		@array[0][1]
	end

	def lift_down(i)
		j = 2 * i + 1
		k = j + 1
		if k >= size
			return if j >= size
			if (@array[i][1] <=> @array[j][1]) > 0
				swap(i, j)
				lift_down(j)
			end
		else
			l = ((@array[j][1] <=> @array[k][1]) < 0 ? j : k)
			if (@array[i][1] <=> @array[l][1]) > 0
				swap(i, l)
				lift_down(l)
			end
		end
	end

	def_delegators :@array, :empty?, :size
end

class Array
	def bsearch_first_index(l = 0, r = size - 1, &pred)
		return nil if l > r
		c = (l + r) / 2 
		if pred[self[c]]
			bsearch_first_index(l, c-1, &pred) || c
		else
			bsearch_first_index(c+1, r, &pred)
		end
	end

	def bsearch_first_item(l = 0, r = size - 1, &pred)
		i = bsearch_first_index(l, r, &pred)
		i ? self[i] : nil
	end

	def bsearch_last_index(l = 0, r = size - 1, &pred)
		return nil if l > r
		c = (l + r) / 2 
		if pred[self[c]]
			bsearch_last_index(c+1, r, &pred) || c
		else
			bsearch_last_index(l, c-1, &pred)
		end
	end

	def bsearch_last_item(l = 0, r = size - 1, &pred)
		i = bsearch_last_index(l, r, &pred)
		i ? self[i] : nil
	end
end

def check(ope_num, customers, deadline)
	queue_heap = Heap.new
	supported = {}
	finished = {}
	working = 0

	start_events = (0..deadline).map { [] }
	giveup_events = (0..deadline).map { [] }
	finish_events = (0..deadline).map { [] }
	start_events[0] = (0..customers.size-1).to_a

	(0..deadline).each do |t|
		start_events[t].each do |id|
			support_time, wait_time, recall_time = customers[id]
			queue_heap.add(id, id)
			gt = t + wait_time
			giveup_events[gt] << id if gt <= deadline
		end

		finish_events[t].each do |id|
			finished[id] = 1
			working -= 1
		end

		until working == ope_num || queue_heap.empty?
			id, _ = queue_heap.del_min
			support_time, wait_time, recall_time = customers[id]
			ft = t + support_time
			finish_events[ft] << id if ft <= deadline
			supported[id] = 1
			working += 1
		end

		giveup_events[t].each do |id|
			next if supported[id]
			support_time, wait_time, recall_time = customers[id]
			queue_heap.del(id)
			st = t + recall_time
			start_events[st] << id if st <= deadline
		end
	end

	return finished.size == customers.size
end

loop do
	n, deadline = gets.split.map(&:to_i)
	break if n == 0
	customers = (1..n).map { gets.split.map(&:to_i) }		
	
	p x = (1..n).to_a.bsearch_first_item {|o| check(o, customers, deadline)}
end