#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

const pair<int,int> pref = {-1,-1};

vector <pair<int,int>> pct;
int n,m,x,y,sol;

inline int det(pair<int,int> &a, pair<int,int> &b){
    long long rez = 1LL*(a.first+1)*(b.second+1) - 1LL*(b.first+1)*(a.second+1);
    if(rez<0)
        return -1;
    if(rez>0)
        return 1;
    return 0;
}


bool solve(pair <int,int> p){
    int u = 0;
    int ant = -1, aux;

    for(int i = 0; i < n; ++i){
        aux = det(p,pct[i])*det(p,pct[i+1]);
        if(aux<=0 && ant!=0)
            ++u;
        ant = aux;
    }

    //cout<<u<<"\n";
    return u%2==0;
}

int main()
{
    freopen("poligon.in","r",stdin);
    freopen("poligon.out","w",stdout);

    scanf("%d %d", &n,&m);
    for(int i=0;i<n;++i){
        scanf("\n%d %d", &x, &y);
        pct.push_back({x,y});
    }
    pct.push_back(pct.front());

    for(int i = 0; i < m; ++i){
        scanf("\n%d %d", &x, &y);
        if(solve({x,y}))
            ++sol;
    }

    cout<<sol;

    return 0;
}