Matcom Online Grader
Faculty of Mathematics and Computer Science of University of Havana

Your favorite football team is playing a charity tournament, which is part of a worldwide fundraising effort to help children with disabilities. As in a normal tournament, three points are awarded to the team winning a match, with no points to the losing team. If the game is drawn, each team receives one point.

Your team played $N$ matches during the rst phase of the tournament, which has just finished. Only some teams, the ones with more accumulated points, will advance to the second phase of the tournament. However, as the main objective of the tournament is to raise money, before the set of teams that will pass to the second phase is determined, each team is allowed to buy additional goals. These new goals count as normally scored goals, and may be used to alter the result of any of the matches the team played. Your team's budget is enough to buy up to $G$ goals. Can you tell the maximum total number of points your team can get after buying the goals, supposing the other teams will not buy any goals?

The rst line contains two integers $N (1 \leq N \leq 10^5)$ and $G (0 \leq G \leq 10^6)$ representing respectively the number of matches your team played and the number of goals your team can buy. Each of the next $N$ lines describes a match result with two integers $S$ and $R (0 \leq S; R \leq 100)$, indicating respectively the goals your team scored and received on that match before buying goals.

Output a line with an integer representing the maximum total number of points your team can get after buying the goals.