Protecting Kingdom

문제

In the kingdom of CPIC (Committee for Public Infrastructure Conservation), there are $nn$ villages numbered from $11$ to $nn$ and connected by a network of $n-1n\; -\; 1$ roads forming a tree structure. Each road connects two villages and has a positive length. Specifically, the $ii$-th road connects village $i+1i\; +\; 1$ with village $p_{i}p\_i$ (1 ≤ p_i ≤ i) and has a length of $l_{i}l\_i$. Due to treacherous terrains and past incidents, some points along these roads are identified as hazardous.

On the $ii$-th road, there are $k_{i}k\_i$ hazardous points located at specific distances $x_{i,1},x_{i,2},\dots ,x_{i,k_i}x\_\{i,1\},\; x\_\{i,2\},\; \backslash dots\; ,\; x\_\{i,\; k\_i\}$ from village $p_{i}p\_i$, satisfying . These distances are integers, indicating positions along the road.

The newly established CPIC Safety Committee aims to enhance traveler safety by deploying a protective measure. They can select any two points on the roads, including villages, and secure the shortest path between them. The path can cover all hazardous points located exactly on it, including its endpoints, and its length must not exceed a given length $ww$.

Given the road network, the positions of the hazardous points, and the maximum allowable path length $ww$, write a program to determine the maximum number of hazardous points that can be covered by optimally choosing the two points and securing the shortest path between them with length ≤ w.

입력

Your program is to read from standard input. The input starts with a line containing two integers, $nn$ and $ww$ (2 ≤ n ≤ 250\,000, 1 ≤ w ≤ 10^{18}), where $nn$ is the number of villages and $ww$ is the maximum allowable length of the secured path. In the following $n-1n\; -\; 1$ lines, the $ii$-th line, which provides information about the $ii$-th road, starts with three integers $p_{i}p\_i$, $l_{i}l\_i$, and $k_{i}k\_i$ (1 ≤ p_i ≤ i, 1 ≤ l_i ≤ 10^{12}, k_i ≥ 0), where $p_{i}p\_i$ is the village connected to village $i+1i\; +\; 1$ by the road, $l_{i}l\_i$ is the length of the road, and $k_{i}k\_i$ is the number of hazardous points on the road. If $k_i>0k\_i\; >\; 0$, the line is followed by $k_{i}k\_i$ integers $x_{i,1},x_{i,2},\dots ,x_{i,k_i}x\_\{i,1\},\; x\_\{i,2\},\; \backslash dots\; ,\; x\_\{i,\; k\_i\}$ (), representing the distances from village $p_{i}p\_i$ to each hazardous point along the road. The total number of hazardous points $k_1+k_2+\cdots +k_{n-1}k\_1\; +\; k\_2\; +\; \backslash cdots\; +\; k\_\{n-1\}$ does not exceed ${10}^{6}10^6$.

출력

Your program is to write to standard output. Print exactly one line. The line should contain the maximum number of hazardous points that can be covered by a shortest path of length $ww$ or less between any two points on the roads.