#include<stdio.h>
#include<string.h>

const int TRUE = 1; 
const int FALSE = 0; 

int stone_X[102]; 
int stone_Y[102]; 
int stone_vistied[102]; 

int number_of_stones; 

int jump(int jump_power, int x, int y, int finish_X, int finish_Y); 

int main()
{
    int T = 0; 
    int i = 0;
    int j = 0;  

    int jump_power = 0; 
    int start_X = 0; 
    int start_Y = 0; 
    int finish_X = 0; 
    int finish_Y = 0; 

    int result = 0; 

    scanf("%d", &T);

    for(j = 0; j< T; j++)
    {
        scanf("%d", &jump_power);

        scanf("%d", &start_X);
        scanf("%d", &start_Y);

        scanf("%d", &finish_X);
        scanf("%d", &finish_Y);

        scanf("%d", &number_of_stones);

        memset(stone_X, 0x00, sizeof(stone_X)); 
        memset(stone_Y, 0x00, sizeof(stone_Y));
        memset(stone_vistied, 0x00, sizeof(stone_vistied)); //set NOT visited.

        for(i = 0;i<number_of_stones;i++)
        {
            scanf("%d", &stone_X[i]);
            scanf("%d", &stone_Y[i]);
        }

        result = jump(jump_power, start_X, start_Y, finish_X, finish_Y); 

        if(result==0)
        {
            printf("NO\n"); 
        }
        else
        {
            printf("YES\n"); 
        }
    }
}

int jump(int jump_power, int x, int y, int finish_X, int finish_Y)
{
    int i = 0;
    int j = 0;  
    int check_if_finshed = 0; 

    for( i = 1; i <= jump_power; i++)
    {
        for(j =0; j< number_of_stones ; j++)
        {
            if(((x-i) == finish_X)&&(y == finish_Y))
            return TRUE; 

            if(((x-i)==stone_X[j])&&(y==stone_Y[j]))
            {
                if(stone_vistied[j]==FALSE)
                {   
                    stone_vistied[j]= TRUE; 
                    check_if_finshed += jump(jump_power, stone_X[j], stone_Y[j], finish_X, finish_Y);
                }
            }

            if(((x+i) == finish_X)&&(y == finish_Y))
                return TRUE;

            if(((x+i)==stone_X[j])&&(y==stone_Y[j]))
            {
                if(stone_vistied[j]==FALSE)
                {   
                    stone_vistied[j]= TRUE; 
                    check_if_finshed += jump(jump_power, stone_X[j], stone_Y[j], finish_X, finish_Y);
                }               
            }

            if((x == finish_X)&&((y+i) == finish_Y))
                return TRUE; 

            if(((x)==stone_X[j])&&((y+i)==stone_Y[j]))
            {
                if(stone_vistied[j]==FALSE)
                {   
                    stone_vistied[j]= TRUE; 
                    check_if_finshed += jump(jump_power, stone_X[j], stone_Y[j], finish_X, finish_Y);
                }                   
            }

            if((x == finish_X)&&((y-i) == finish_Y))
                return TRUE; 

            if(((x)==stone_X[j])&&((y-i)==stone_Y[j]))
            {
                if(stone_vistied[j]==FALSE)
                {   
                    stone_vistied[j]= TRUE; 
                    check_if_finshed += jump(jump_power, stone_X[j], stone_Y[j], finish_X, finish_Y);
                }               
            }
        }
    }
    return check_if_finshed; 
}