//
//  main.cpp
//  Poligon
//
//  Created by Darius Buhai on 26/01/2019.
//  Copyright © 2019 Darius Buhai. All rights reserved.
//

#include <iostream>
#include <cstdio>

#define MAXC 60001
#define MAXN 801

using namespace std;

int n, m, nrin;
struct point{
    int x, y;
}p[MAXN], pint, pext;

int det(point a, point b, point c)
{
    return (a.x*b.y+b.x*c.y+a.y*c.x)-(b.y*c.x+a.x*c.y+a.y*b.x);
}

bool verif_in(point pint){
    int nrint = 0;
    for(int i=0;i<n;i++){
        point A = p[i], B = p[0];
        if(i<n-1) B = p[i+1];
        int d1 = det(pint, A, B);
        int d2 = det(pext, A, B);
        int d3 = det(A, pint, pext);
        int d4 = det(B, pint, pext);
        if(d1*d2<=0 && d3*d4<0)
            nrint++;
    }
    return (bool)nrint%2;
}

int main() {
    freopen("poligon.in", "r", stdin);
    freopen("poligon.out", "w", stdout);
    pext = {MAXC, MAXC};
    scanf("%d %d\n", &n, &m);
    for(int i=0;i<n;i++){
        scanf("%d %d\n", &p[i].x, &p[i].y);
        if(p[i].x<pext.x) pext.x = p[i].x;
        if(p[i].y<pext.y) pext.y = p[i].y;
    }
    pext.x--;pext.y--;
    for(int i=0;i<m;i++){
        scanf("%d %d\n", &pint.x, &pint.y);
        if(verif_in(pint))
            nrin++;
    }
    printf("%d\n", nrin);
    return 0;
}