Travel to Bertown

Description:

Input:

The first line contains a single integer $$$t$$$ ($$$1 \le t \le 500$$$) — the number of test cases.

The first line of each test case contains two integers $$$n$$$ and $$$k$$$ ($$$1 \le n, k \le 100$$$) — the number of Vika's friends and the day when Vika comes to Bertown.

Then follow $$$n$$$ lines, each containing two integers $$$l_i$$$ and $$$r_i$$$ ($$$1 \le l_i \le r_i \le 100$$$) denoting the period when Vika can stay at the $$$i$$$-th friend's house.

Output:

For each test case, output a single integer — the maximum number of days that Vika can stay in Bertown (or $$$0$$$ if none of Vika's friends can host her on day $$$k$$$).

Sample Input:

3
3 3
1 4
2 6
4 10
2 4
2 3
5 8
2 4
4 4
1 3

Sample Output:

4
0
1

Note:

In the first example, Vika can stay at the $$$2$$$-nd friend's house from $$$3$$$-rd to $$$6$$$-th day.

In the second example, none of Vika's friends can host her on the $$$4$$$-th day.

In the third example, Vika can stay at the $$$1$$$-st friend's house, but only for the $$$4$$$-th day.