A8444 | Porcelain

During her tantrums the princess usually smashes some collectable porcelain. Every furious shriek is accompanied with one item smashed.

The collection of porcelain is arranged neatly on $n$ shelves. Within each shelf the items are placed in one row, so that one can access only the outermost items — the leftmost or the rightmost item, not the ones in the middle of the shelf. Once an item is taken, the next item on that side of the shelf can be accessed (see example). Once an item is taken, it can't be returned to the shelves.

You are given the values of all items. Your task is to find the maximal damage the princess' tantrum of $m$ shrieks can inflict on the collection of porcelain.

The first line of input data contains two integers $n$ ( $1<=n<=100$ ) and $m$ ( $1<=m<=10000$ ). The next $n$ lines contain the values of the items on the shelves: the first number gives the number of items on this shelf (an integer between $1$ and $100$ , inclusive), followed by the values of the items (integers between $1$ and $100$ , inclusive), in the order in which they appear on the shelf (the first number corresponds to the leftmost item, the last one — to the rightmost one). The total number of items is guaranteed to be at least $m$ .

Output the maximal total value of a tantrum of $m$ shrieks.