CF BUDDY
← Problems·

1834D · Survey in Class

1900 · brute force, data structures, greedy

Problem: Zinaida Viktorovna has nn students in her history class. The homework for today included mm topics, but the students had little time to prepare, so ii-th student learned only topics from lil_i to rir_i inclusive.

At the beginning of the lesson, each student holds their hand at 00. The teacher wants to ask some topics. It goes like this:

  • The teacher asks the topic kk.
  • If the student has learned topic kk, then he raises his hand by 11, otherwise he lower it by 11.

Each topic Zinaida Viktorovna can ask no more than one time.

Find the maximum difference of the heights of the highest and the lowest hand that can be in class after the survey.

Note that the student's hand can go below 00.

Input Format: Each test contains multiple test cases. The first line contains the number of test cases tt (1t1041 \le t \le 10^4). The description of the test cases follows.

The first line of each test case contains two integers nn and mm (2n105,1m1092 \le n \le 10^5, 1 \le m \le 10^9) — the number of students and the number of topics, respectively.

Each of the next nn lines of each test case contain two integers lil_i and rir_i (1lirim1 \le l_i \le r_i \le m) — the endpoints of the segment of topics that ii-th student has learned.

It is guaranteed that the sum of nn over all test cases does not exceed 10510^5.

Output Format: For each test case, print one integer — the maximum difference of the heights of the highest and the lowest hand that can be in the class after the survey.

Note: In the first test case, Zinaida Viktorovna can ask the topics 5,6,7,85, 6, 7, 8. Then the hand of the 22-nd student will be at the height of 44, and the hand of the 44-th will be at the height of 2-2, that is, the difference will be equal to 66.

In the second test case, you can ask about the topics 11 and 33. Then the hand of the 11-st student will be at the height of 22 and the hand of the 33-rd student will be at the height of 2-2. So the difference will be 44.

In the third test case, the difference between the highest and lowest hand will be 00 for any set of topics asked.

In the fifth test case, you can ask all topics. Then the difference between the heights of the 11-st and 33-rd students' hands will be 1212.

Sample Cases

Case 1

Input

6
4 8
2 6
4 8
2 7
1 5
3 3
1 3
2 3
2 2
3 5
1 5
1 5
1 5
3 5
1 1
3 3
5 5
4 7
1 7
1 3
3 3
4 5
2 4
1 3
2 4

Output

6
4
0
2
12
2

Similar problems

00:00:00
Loading editor…
Welcome! I'm your coding tutor for this problem. Use the chips below to reveal stored hints or get AI feedback on your code. I'll guide you step by step — never giving away the solution.

Sign in to unlock AI tutor feedback