시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 32 MB 0 0 0 0.000%

문제

Byteman woke up early this morning, just after dawn. He is planning to get to the top of Bytemountain, so the spent the night in a mountain hostel right in the middle of picturesque mountain range of Lower Bytehills. Since Bytemountain in the highest mountain of the range, at each trail crossing there is a signpost pointing at the trail leading towards its peak.

In the mountain hostel Byteman met a guide who knows Lower Bytehills like the back of his hand. The guide informed Byteman that the signposts are being reorganized and because of that he should not rely too much on the signposts. In particular, the very peak of Bytemountain is also a crossing and at this crossing there is a signpost pointing to some trail "leading" to Bytemountain!

The guide will explain Byteman how to get to the peak. Luckily, all trail crossings are numbered from 1 to n and each crossing contains a tablet with the number of the crossing written on it. The guide's directions will have the following form: "Walk along the trails pointed by the signposts until you reach crossing s1, then take a map and choose the trail connecting crossing s1 with crossing c1. Afterwards keep walking along the trails pointed by the signposts until you reach crossing s2. The take a look at the map and choose the trail connecting s2 and c2... Finally, when you reach si, take the last look at the map and walk along the trail connecting si and ci. If you keep walking along the trails pointed by the signposts since then, you will reach the peak of Bytemountain."

Byteman would not like the description of the route to be too complicated, so he asked the guide for a route that would not require looking at the map more than k times.

The guide had to take a deeper thought, because he knows that some trails are more exciting than others and he would like to show Byteman the most interesting route.

The route may lead through the same trails and crossing many times (some trails are so exciting that they may be worth visiting multiple times!)

Byteman ends his walk when he reaches the peak for the first time after using all instructions provided by the guide. This means that Byteman can visit the peak of Bytemountain multiple times during the walk, but he will end his walk only after all instructions have been used.

How interesting can the route provided by the guide be?

입력

The first line of the standard input contains two integers n and k (1 ≤ n ≤ 50 000, 0 ≤ k ≤ 100) separated by a single space. They denote the number of trail crossings and the maximum number of times Byteman would like to look at the map. The crossings are numbered from 1 to n, the mountain hostel is located at crossing 1, and the peak of Bytemountain is the crossing number n.

The following n lines contain descriptions of the respective trail crossings. Each crossing's description consists of a single line and is composed of integers separated by single spaces. The first one of these numbers, mi (1 ≤ min - 1), denotes the number of trails going out of the crossing. After that there are mi pairs of numbers ai,j, bi,j (1 ≤ ai,j ≤ n, 1 ≤ bi,j ≤ 10 000), meaning that from the ith crossing there is a trail leading to crossing ai,j with beauty equal to bi,j. The first pair of numbers denotes the trail that leads to Bytemountain according to the signpost at the crossing. Each trail is bidirectional and connects two different crossings. Each two crossings can be connected by at most one trail. The total number of all trails does not exceed 100 000.

Each trail connecting crossings i and j will appear in the input twice: first time in the list of trails going out of the ith crossing and second time in the list of trails going out of the jth crossing. In both cases the beauty of the trail will be the same.

출력

The first and only line of the standard output should contain a single integer denoting the maximum possible sum of beauties of consecutive trails on the route from the mountain hostel to the peak of Bytemountain that satisfies Byteman's requirements. You can assume that there exists at least one such route.

예제 입력 1

5 2
2 3 4 2 2
3 1 2 5 4 4 3
2 1 4 4 3
3 2 3 5 5 3 3
2 2 4 4 5

예제 출력 1

14

힌트

In the above figure the edges represent trails connecting respective crossings, the numbers next to the edges - the beauties of the trails, and the arrows denote the trails pointed by the signposts at respective crossings.

The guide will ask Byteman to look at the map twice, at crossings number 3 and 2. This way Byteman's walk will lead along the route 1 → 3 → 4 → 2 → 5. The total beauty of the trails on this route is 14.