import java.util.ArrayList;
import java.util.Scanner;

public class BRAVEDUCK {

    public static void main(String[] args) {
        // TODO Auto-generated method stub

        Scanner input = new Scanner(System.in);

        int count = input.nextInt();
        int loop_count = 0;

        while(loop_count < count) {

            int max_jump = input.nextInt();
            int[] s_to_g_point = new int[4];

            for(int i=0; i<4; i++) {
                s_to_g_point[i] = input.nextInt();
            }

            int rock_count = input.nextInt();
            int[] rocks_axis = new int[rock_count*2];

            for(int i=0; i<rocks_axis.length; i++) {
                rocks_axis[i] = input.nextInt();
            }

            if(JumpDuck(max_jump, s_to_g_point, rocks_axis)) {
                System.out.println("YES");
            } else {
                System.out.println("NO");
            }
            loop_count++;
        }
    }

    public static boolean JumpDuck(int max_jump, int[] s_to_g_point, int[] rocks_axis) {

        ArrayList<Integer> DFS = new ArrayList<Integer>();

        int current_x = 0;
        int current_y = 0;
        boolean goal_flag = false;

        DFS.add(-1001);

        for(int i=0; i<DFS.size(); i++) {

            if(i == 0){
                current_x = s_to_g_point[0];
                current_y = s_to_g_point[1];
            } else {
                current_x = rocks_axis[2*DFS.get(i)];
                current_y = rocks_axis[2*DFS.get(i)+1];
            }

            for(int j=0; j<rocks_axis.length/2; j++) {

                if(Math.abs(rocks_axis[2*j] - current_x) <= max_jump && current_y == rocks_axis[2*j+1] ) {

                    if(checkDuplicate(DFS, j)) {
                        DFS.add(j);
                    }

                } else if (Math.abs(rocks_axis[2*j+1] - current_y) <= max_jump && current_x == rocks_axis[2*j] ) {

                    if(checkDuplicate(DFS, j)) {
                        DFS.add(j);
                    }
                }
            }

            if(Math.abs(s_to_g_point[2] - current_x) <= max_jump && current_y == s_to_g_point[3] ) {
                goal_flag = true;
                break;
            } else if (Math.abs(s_to_g_point[3] - current_y) <= max_jump && current_x == s_to_g_point[2] ) {
                goal_flag = true;
                break;
            }
        }

        return goal_flag;

    }

    public static boolean checkDuplicate(ArrayList<Integer> DFS, int num) {

        boolean flag = true;

        for(int i=0; i<DFS.size(); i++) {
            if(num == DFS.get(i)) {
                flag = false;
                break;
            }
        }
        return flag;
    }
}