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.

import java.util.*;
import java.io.*;
 
public class Main {
static        List<Integer>[] gp;
static int cnt1=0;
static int cnt2=0;
    public static void main(String[] args)  {
  
      try{
       PrintWriter out = new PrintWriter(System.out);
        int t=in.nextInt();
        while(t-->0){
        int n=in.nextInt();
        int x=in.nextInt();
        int m=in.nextInt();
        int cur=0;
        int l=x,r=x;
        for(int i=0;i<m;i++){int L=in.nextInt();
        int R=in.nextInt();
        if(Math.max(l,L)<=Math.min(R,r)){
            l=Math.min(l,L);
            r=Math.max(R,r);
        }
        
        }
       // System.out.println(Arrays.toString(a)+" "+x+" "+cur);
        int res=r-l+1;
        out.println(res);
        out.flush();
        }   // System.ot.println();
           
      }catch(Exception e){
         e.printStackTrace();
      }  
	}
	
	static void dfs(int i,int c,HashSet<Integer> hs){
	    if(c==1){
	        cnt1++;
	    }else{
	        cnt2++;
	    }
	    hs.add(i);
	    for(int j:gp[i]){
	        if(!hs.contains(j))dfs(j,-c,hs);
	    }
	}
    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
 
    static FastReader in = new FastReader();
	
}