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.io.*;
import java.math.BigInteger;
import java.util.*;

public class Main {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter pw = new PrintWriter(System.out);
    static int MOD = 1000000007;

    public static void main(String[] args) throws IOException {
        Main m = new Main();
        m.solve();
        m.close();
    }

    void close() throws IOException {
        pw.flush();
        pw.close();
        br.close();
    }

    int readInt() throws IOException {
        return Integer.parseInt(br.readLine());
    }

    long readLong() throws IOException {
        return Long.parseLong(br.readLine());
    }

    int[] readIntLine() throws IOException {
        String[] tokens = br.readLine().split(" ");
        int[] A = new int[tokens.length];
        for (int i = 0; i < A.length; i++)
            A[i] = Integer.parseInt(tokens[i]);
        return A;
    }

    long[] readLongLine() throws IOException {
        String[] tokens = br.readLine().split(" ");
        long[] A = new long[tokens.length];
        for (int i = 0; i < A.length; i++)
            A[i] = Long.parseLong(tokens[i]);
        return A;
    }

    void solve() throws IOException {
        int t = readInt();
        for (int ti = 0; ti < t; ti++) {
            int[] nxm = readIntLine();
            int n = nxm[0];
            int x = nxm[1];  // a[x] = 1
            int m = nxm[2];
            int[][] lr = new int[m][];
            List<int[]> intervals = new ArrayList<>();
            intervals.add(new int[]{x, x});
            for (int i = 0; i < m; i++) {
                lr[i] = readIntLine();
                boolean intersect = false;
                for (int[] interval : intervals) {
                    if (lr[i][1] >= interval[0] && interval[1] >= lr[i][0]) {
                        intersect = true;
                        break;
                    }
                }
                if (intersect) {
                    intervals.add(lr[i]);
                    intervals = merge(intervals);
                }
            }
            int ans = 0;
            for (int[] a : intervals) {
                ans += a[1] - a[0] + 1;
            }
            pw.println(ans);
        }
    }

    public List<int[]> merge(List<int[]> intervals) {
        if (intervals.size() == 0) return intervals;
        List<int[]> ans = new ArrayList<>();
        Collections.sort(intervals, new Comparator<int[]>() {
            public int compare(int[] a, int[] b) {
                return a[0] - b[0];
            }
        });
        
        int i = 0;
        int start;
        int end;
        while (i < intervals.size()) {
            start = intervals.get(i)[0];
            end = intervals.get(i)[1];
            ++i;
            while (i < intervals.size() && intervals.get(i)[0] <= end) {
                end = Math.max(end, intervals.get(i)[1]);
                ++i;
            }
            ans.add(new int[]{start, end});
        }
        return ans;
    }
}