Problem Description Given an array A of N elements representing the monsters and an array B of Q elements representing the heros. The i-th type of monster is represented by A[i][0],A[i][1] and A[D][2] which means a monster of the i-th type is present at each integer co-ordinate from A[i][0] to A[i][1] and having a strength of A[i][2] The i-th type of hero is represented by 8[i][0] and B[i][1] which means a hero of strength 8[0][1] will appear at the integer point 8[i][0] after i seconds. When the i-th hero appears it will destroy each and every monster present at B[i][0] and having a strength less than B[i][1]. For each i you have to determine the number of monsters left after the i-th hero has completed their task. Problem Constraints 1<>