#include <bits/stdc++.h>
using namespace std;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
#define int long long
InParser in("poligon.in");
OutParser out("poligon.out");
int n, m, ans;
pair<int, int> v[805];
int det(int x1, int y1, int x2, int y2, int x3, int y3)
{
return (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1);
}
int pctseg(int x1, int y1, int x2, int y2, int x3, int y3)
{
int d = det(x1, y1, x2, y2, x3, y3);
if(d == 0 && x3 >= min(x1, x2) && x3 <= max(x1, x2) && y3 >= min(y1, y2) && y3 <= max(y1, y2))
{
return 1;
}
return 0;
}
signed main()
{
in>>n>>m;
for(int i = 1; i<=n; i++)
{
in>>v[i].first>>v[i].second;
}
v[0] = v[n];
long long x, y, xv, yv, inter, d1, d2, d3, d4;
while(m--)
{
in>>x>>y;
xv = 69696;
yv = 71717;
inter = 0;
for(int i = 0; i<n; i++)
{
d1 = det(v[i].first, v[i].second, v[i + 1].first, v[i + 1].second, x, y);
d2 = det(v[i].first, v[i].second, v[i + 1].first, v[i + 1].second, xv, yv);
d3 = det(x, y, xv, yv, v[i].first, v[i].second);
d4 = det(x, y, xv, yv, v[i + 1].first, v[i + 1].second);
if(d1 * d2 < 0 && d3 * d4 < 0)
{
inter++;
}
}
if(inter % 2 == 1)
{
ans++;
}
}
out<<ans;
return 0;
}