B"A squad of n warriors is defending a castle from a dragon attack. There are m barricades between the castle and the dragon. The warriors are numbered from 1 to n . The i -th warrior knows k_i attacks: the j -th of them deals a_{i,j} damage to the dragon and can only be applied if there are exactly b_{i,j} barricades between the castle and the dragon. The warriors make turns one after another, starting from warrior 1 . After warrior n makes his turn, the total damage to the dragon is calculated. The i -th warrior performs exactly one of three possible moves in his turn: The total damage is the sum of damages dealt by the warriors who chose to deploy their attacks in their turn. What is the maximum total damage the warriors can deal to the dragon? The first line contains two integers n and m ( 1 <= n, m <= 3 cdot 10^5 ) -- the number of warriors and the initial number of barricades. Then the descriptions of attacks for each warrior follow. The i -th description consists of three lines. The first line contains a single integer k_i ( 1 <= k_i <= m + 1 ) -- the number of attacks the i -th warrior knows. The second line contains k_i integers a_{i,1}, a_{i,2}, ... , a_{i,k_i} ( 1 <= a_{i,j} <= 10^9 ) -- the damage of each attack. The third line contains k_i integers b_{i,1}, b_{i,2}, ... , b_{i,k_i} ( 0 <= b_{i,j} <= m ) -- the required number of barricades for each attack. b_{i,j} for the i -th warrior are pairwise distinct. The attacks are listed in the increasing order of the barricades requirement, so b_{i,1} < b_{i,2} < ... < b_{i,k_i} . The sum of k_i over all warriors doesn't exceed 3 cdot 10^5 . Print a single integer -- the maximum total damage the warriors can deal to the dragon. In the first example, the optimal choice is the following: The total damage is 10 . If"...