Bessie is hoping to fool Farmer John by building a herd of k realistic robotic cows.

It turns out that building a robotic cow is somewhat complicated. There are n individual locations on the robot into which microcontrollers must be connected (so a single microcontroller must be connected at each location). For each of these locations, Bessie can select from a number of different models of microcontroller, each varying in cost.

For the herd of robotic cows to look convincing to Farmer John, no two robots should behave identically. Therefore, no two robots should have exactly the same set of microcontrollers. For any pair of robots, there should be at least one location at which the two robots use a different microcontroller model. It is guaranteed that there will always be enough different microcontroller models to satisfy this constraint.

Bessie wants to make her robotic herd as cheaply as possible. Help her determine the minimum possible cost to do this!

Input

The first line contains n (1 ≤ n ≤ 105) and k (1 ≤ k ≤ 105).

The following n lines contain a description of the different microcontroller models available for each location. The i-th such line starts with mi (1 ≤ mi ≤ 10), giving the number of models available for location i. This is followed by mi space separated integers pi,j (1 ≤ pi,j ≤ 108) giving the costs of these different models.

Output

Output a single line, giving the minimum cost to construct k robots.