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.
"Educational Codeforces Round 89 (Rated for Div. 2)"
"A. Shovels and Swords"
# y=int(input())
# ans=[]
# for i in range(y):
#     al=input().split()
#     m = list(map(int, al))
#     a=min(m[0],m[1])
#     b=max(m[0],m[1])
#     d=int((b+a)/3)
#     t=0
#     t=min(d,a,b)
#     ans.append(t)
# for i in ans:
#     print(i)   
"B. Shuffle"
y=int(input())
ans=[]
for i in range(y):
    al=input().split()
    m = list(map(int, al))
    n=m[0]
    x=m[1]
    s=m[2]
    a=x
    b=x
    for j in range(s):
        al=input().split()
        m = list(map(int, al))
        l=m[0]
        r=m[1]
        if a!=b:
            #print(a,b,l,r,"if",l<=b,a<=r,l!=r,((l<=b or a<=r) and l!=r))
            if l!=r and((l<=b and b<=r) or (l<=a and a<=r)):
                a=min(a,l)
                b=max(b,r)
    
        else:
            #print(a,b,l,r,"else",l<=b,a<=r,l!=r,((l<=b and a<=r) and l!=r))
            if ((l<=b and a<=r) and l!=r):
                a=l
                b=r
        #print(a,b,l,r,"-----")                
    ans.append(b-a+1)        
for i in ans:
    print(i) 