/********************* Template ************************/

#include <set>

#include <map>

#include <list>

#include <cmath>

#include <ctime>

#include <deque>

#include <queue>

#include <stack>

#include <bitset>

#include <cstdio>

#include <string>

#include <vector>

#include <cassert>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <fstream>

#include <numeric>

#include <iomanip>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define EPS         1e-8

#define MAXN        100005

#define MOD         (int)1e9+7

#define PI          acos(-1.0)

#define INF         ((1LL)<<50)

#define max(a,b)    ((a) > (b) ? (a) : (b))

#define min(a,b)    ((a) < (b) ? (a) : (b))

#define max3(a,b,c) (max(max(a,b),c))

#define min3(a,b,c) (min(min(a,b),c))

#define BUG         cout<<"BUG! "<<endl

#define LINE        cout<<"------------------"<<endl

#define L(t)        (t << 1)

#define R(t)        (t << 1 | 1)

#define Mid(a,b)    ((a + b) >> 1)

#define lowbit(a)   (a & -a)

#define FIN         freopen("in.txt","r",stdin)

#pragma comment     (linker,"/STACK:102400000,102400000")

// typedef long long LL;

// typedef unsigned long long ULL;

// typedef __int64 LL;

// typedef unisigned __int64 ULL;

// int gcd(int a,int b){ return b?gcd(b,a%b):a; }

// int lcm(int a,int b){ return a*b/gcd(a,b); }

/*********************   F   ************************/

struct POINT{

    double x,y;

    POINT(double _x = , double _y = ):x(_x),y(_y){};

    void show(){

        cout<<x<<" "<<y<<endl;

    }

};

POINT p[MAXN],wp[MAXN];

double multiply(POINT sp,POINT ep,POINT op){ //叉积

    return (sp.x-op.x) * (ep.y-op.y) - (ep.x-op.x) * (sp.y-op.y);

}

bool onseg(POINT a,POINT s,POINT e){   // 判断点是否在线段上

    if(multiply(a,s,e) ==  && a.x <= max(s.x,e.x) && a.x >= min(s.x,e.x)

       && a.y <= max(s.y,e.y) && a.y >= min(s.y,e.y))

        return true;

    return false;

}

bool inside(POINT pp,POINT sp,POINT ep,POINT op){ //判断点pp是否在三角形中(极角序)

    if(onseg(pp,sp,ep) || onseg(pp,sp,op) || onseg(pp,ep,op)) //如果在三角形上

        return true;

    if(multiply(sp,ep,pp) >  && multiply(ep,op,pp) >

       && multiply(sp,op,pp) < )  //如果在三角形内

           return true;

    return false;

}

bool bsearch(POINT a,int len){    //二分所构造的三角形

    int l = ,r = len,m;

    while(l < r){

        m = (l + r) / ;

        if(inside(a,p[],p[m],p[m+]) == true) return true;

        if(multiply(p[],p[m],a) >=  && multiply(p[],p[m+],a) <=

            && multiply(p[m],p[m+],a) < ) return false;

        if(multiply(p[],p[m],a) >  && multiply(p[],p[m+],a) > )

            l = m + ;

        else r = m;

    }

    return false;

}

int main()

{

    //freopen("in.txt","r",stdin);

    int n,m,k,tmp = ,cnt = ;

    scanf("%d%d%d",&n,&m,&k);

    for(int i =  ; i < n ; i++)

        scanf("%lf%lf",&p[i].x,&p[i].y);

    p[n] = p[];

    for(int i =  ; i < m ; i++){

        scanf("%lf%lf",&wp[i].x,&wp[i].y);

        if(bsearch(wp[i],n-) == true) cnt++;

    }

    if(cnt >= k) printf("YES\n");

    else printf("NO\n");

    return ;

}