// combat
#include <fstream>
#include <iostream>
using namespace std;

int n,m;
int point[1000][2];
int ans[1000][2];
int cnt;

int check(int p1,int p2,int p3)
{
	int ax = ans[p1][0];
	int ay = ans[p1][1];
	int bx = point[p2][0];
	int by = point[p2][1];
	int cx = point[p3][0];
	int cy = point[p3][1];
	return (ax*by + bx*cy + cx*ay - (ax*cy + bx*ay + cx*by));
}

int solve(int sets)
{
	cnt = 0;
	bool flag_p,flag_m;
	for(int i=0;i<m;i++){
		flag_p = false;
		flag_m = false;
		for(int j=0;j<n;j++){
			int a = check(i,j,(j+1)%n);
			if(a > 0){
				flag_p = true;
			}else if(a < 0){
				flag_m = true;
			}
		}
		
		if(flag_p && flag_m){
		}else{
			cnt++;
		}
	}
	
	cout<<"Data set "<<sets<<": "<<cnt<<endl;
}

int main()
{
  ifstream cin("inside.txt");
  
	for(int sets=1;;sets++){
		cin>>n>>m;
		if(!n && !m) break;
		for(int i=0;i<n;i++){
			cin>>point[i][0]>>point[i][1];
		}
		for(int i=0;i<m;i++){
			cin>>ans[i][0]>>ans[i][1];
		}
		
		solve(sets);
	}
  
  return 0;
}