You are given an array consisting of n integers a_1, a_2, ..., a_n. Initially a_x = 1, all other elements are equal to 0.

You have to perform m operations. During the i-th operation, you choose two indices c and d such that l_i ≤ c, d ≤ r_i, and swap a_c and a_d.

Calculate the number of indices k such that it is possible to choose the operations so that a_k = 1 in the end.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Then the description of t testcases follow.

The first line of each test case contains three integers n, x and m (1 ≤ n ≤ 10^9; 1 ≤ m ≤ 100; 1 ≤ x ≤ n).

Each of next m lines contains the descriptions of the operations; the i-th line contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n).

Output

For each test case print one integer — the number of indices k such that it is possible to choose the operations so that a_k = 1 in the end.

Example

Input


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


Output


6
2
3

Note

In the first test case, it is possible to achieve a_k = 1 for every k. To do so, you may use the following operations:

  1. swap a_k and a_4; 
  2. swap a_2 and a_2; 
  3. swap a_5 and a_5. 



In the second test case, only k = 1 and k = 2 are possible answers. To achieve a_1 = 1, you have to swap a_1 and a_1 during the second operation. To achieve a_2 = 1, you have to swap a_1 and a_2 during the second operation.
'''input
3
6 4 3
1 6
2 3
5 5
4 1 2
2 4
1 2
3 3 2
2 3
1 2
'''

import math
import sys
import itertools
import random

def lcm(x, y):
	return (x*y)//math.gcd(x,y)
def hcf(x, y):
	return math.gcd(x, y)
def primes(n):
	prime=[True for _ in range(0, n+1)]
	res=[]
	p=2
	while p*p<=n:
		if prime[p]==True:
			for i in range(p*p,n+1,p):
				prime[p]=False
		p+=1
	for i in range(0, n+1):
		if prime[i]==True:
			res.append(i)
	return res
def primeFactors(n):
	res=[]
	while n%2==0:
		res.append(2)
		n//=2
	for i in range(3, math.sqrt(n)+1, 2):
		while n%i==0:
			res.append(i)
			n//=i
	if n>2:
		res.append(n)
	return res


for _ in range(0, int(input())):
	# n=int(input())                                 # Single Digit Input
	n, x, m = map(int, input().strip().split())    # Many Digit Input
	# l=list(map(int, input().strip().split()))      # List Input
	# s=list(input())                                # Character Array Input
	q=[]
	for __ in range(0, m):
		q.append(list(map(int, input().strip().split())))

	lower = x
	upper = x
	for i in q:
		# print(lower, upper)
		if i[1]<=upper and i[1]>=lower and i[0]<=lower:
			lower = i[0]
		elif i[0]<=upper and i[0]>=lower and i[1]>=upper:
			upper=i[1]
		elif i[0]<=lower and i[1]>upper:
			lower=i[0]
			upper=i[1]
		elif i[0]>=lower and i[1]<=upper:
			pass
	print(upper-lower+1)