#include <fstream>

using namespace std;

ifstream f("poligon.in");
ofstream g("poligon.out");

int n,m,con,auxX,auxY;
int vertx[801],verty[801];

bool crossProduct(int x1, int y1, int x2, int y2, int x3, int y3)
{
    if( (x1 * y2 + x2 * y3 + x3 * y1 - x3 * y2 - x1 * y3 - x2 * y1) > 0)
        return true;
    return false;
}

int main()
{
    f >> n >> m;

    for(int i = 1; i <= n; ++i)
        f >> vertx[i] >> verty[i];

    vertx[n + 1] = vertx[1];
    verty[n + 1] = verty[1];

    for(int l = 1; l <= m; l++)
    {
        f >> auxX >> auxY;
        bool semn = crossProduct(vertx[1], verty[1], vertx[2], verty[2], auxX, auxY);

        bool flag = true;
        for(int i = 2; i <= n; i++)
            if( crossProduct(vertx[i], verty[i], vertx[i + 1], verty[i + 1], auxX, auxY) != semn)
            {
                i = n + 1;
                flag = false;
            }

        if(flag)
            ++con;
    }

    g << con << "\n";

    return 0;
}