B"You are playing a computer game, where you lead a party of m soldiers. Each soldier is characterised by his agility a_i . The level you are trying to get through can be represented as a straight line segment from point 0 (where you and your squad is initially located) to point n + 1 (where the boss is located). The level is filled with k traps. Each trap is represented by three numbers l_i , r_i and d_i . l_i is the location of the trap, and d_i is the danger level of the trap: whenever a soldier with agility lower than d_i steps on a trap (that is, moves to the point l_i ), he gets instantly killed. Fortunately, you can disarm traps: if you move to the point r_i , you disarm this trap, and it no longer poses any danger to your soldiers. Traps don't affect you, only your soldiers. You have t seconds to complete the level -- that is, to bring some soldiers from your squad to the boss. Before the level starts, you choose which soldiers will be coming with you, and which soldiers won't be. After that, you have to bring all of the chosen soldiers to the boss. To do so, you may perform the following actions: Note that after each action both your coordinate and the coordinate of your squad should be integers. You have to choose the maximum number of soldiers such that they all can be brought from the point 0 to the point n + 1 (where the boss waits) in no more than t seconds. The first line contains four integers m , n , k and t ( 1 <= m, n, k, t <= 2 cdot 10^5 , n < t ) -- the number of soldiers, the number of integer points between the squad and the boss, the number of traps and the maximum number of seconds you may spend to bring the squad to the boss, respectively. The second line contains m integers a_1 , a_2 , ..., a_m ( 1 <= a_i <= 2 cdot 10^5 ), where a_i is the agility of the i -th s"...