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.security.acl.LastOwnerException;
import java.util.*;
import java.lang.*;
import java.io.*;
public class Dominated_Subarray {

  public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

  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[] nextSArray() {
      String sr[] = null;
      try {
        sr = br.readLine().trim().split(" ");
      } catch (IOException e) {
        e.printStackTrace();
      }
      return sr;
    }

    String nextLine() {
      String str = "";
      try {
        str = br.readLine();
      } catch (IOException e) {
        e.printStackTrace();
      }
      return str;
    }
  }
//  static int MOD=1000000000+7;
//  public static void sortbyCol(int arr[][],int col)
//  {
//    Arrays.sort(arr,new Comparator<int[]>(){
//      @Override
//      public int compare(int[] o1, int[] o2) {
//        // To sort in descending order revert
//        // the '>' Operator
//        if(o1[col]>o2[col])
//          return 1;
//        else
//          return -1;
//      }
//    });
//  }


  public static void main(String[] args) throws java.lang.Exception {
    FastReader sc = new FastReader();
    int t1=sc.nextInt();
    for(int t=0;t<t1;++t)
    {
      String s[]=sc.nextSArray();
      long n=Long.parseLong(s[0]);
      long x= Long.parseLong(s[1]);
      int m=Integer.parseInt(s[2]);
      long arr[][]=new long[m][2];
      long ans=1,xl=0,xr=0;
      boolean found=false;
      for(int i=0;i<m;++i)
      {
        String ss[]=sc.nextSArray();
        long l=Long.parseLong(ss[0]);
        long r=Long.parseLong(ss[1]);
        arr[i][0]=l;
        arr[i][1]=r;
        if(!found&&l<=x&&x<=r)
        {
          ans=r-l+1;
          xl=l;
          xr=r;
          found=true;
        }
        else if((!((r<xl&&l<xl)||(r>xr&&l>xr)))&&found)
        {
          long oldxl=xl;long oldxr=xr;
          //System.out.println("Sss");

          xl=Math.min(xl,l);
          xr=Math.max(xr,r);
          ans=xr-xl+1;
          //System.out.println(xr+" "+xl);
        }


      }
      out.println(ans);

    }
    out.close();

  }
}

