#include <cstdio>
#include <vector>
#include <complex>
#include <cmath>
using namespace std;

#define EPS 1e-7

typedef complex<double> P;
typedef const P &rP;
typedef const vector<P> &cvP;

double pi;

bool checkarg(double a, double b, double c){
	double pi2 = pi * 2.0;
	while(b + EPS < a) b += pi2;
	while(b > a + pi2 + EPS) b -= pi2;
	while(c + EPS < b) c += pi2;
	while(c > a + pi2 + EPS) c -= pi2;

	return a < b + EPS && b < c + EPS;
}

vector<P> input(int n){
	int x, y;
	vector<P> v(n);
	for(int i = 0; i < n; ++i){
		scanf("%d%d", &x, &y);
		v[i] = P(x, y);
	}
	return v;
}

bool reach(P house, double d, double a, double w){
	if(norm(house) > a * a + EPS) return false;
	return checkarg(w - d * 0.5, arg(house), w + d * 0.5);
}

bool check(rP house, cvP us, double du, cvP ms, double dm, cvP ss, double ds, double a, double w){
	if(!reach(house, du, a, w)) return false;
	for(int i = 0; i < us.size(); ++i){
		if(reach(house - us[i], du, a, w)) return false;
	}
	for(int i = 0; i < ms.size(); ++i){
		if(reach(house - ms[i], dm, a, w)) return false;
	}
	for(int i = 0; i < ss.size(); ++i){
		if(reach(house - ss[i], ds, a, w)) return false;
	}
	return true;
}

int main(){
	pi = acos(-1.0);

	int h, r, u, m, s;
	double du, dm, ds;
	while(scanf("%d%d", &h, &r), h){
		vector<int> ans;
		int mincnt = 1;
		
		vector<P> hs = input(h);

		scanf("%d%d%d%lf%lf%lf", &u, &m, &s, &du, &dm, &ds);
		du *= pi / 180.0;
		dm *= pi / 180.0;
		ds *= pi / 180.0;

		vector<P> us = input(u), ms = input(m), ss = input(s);

		vector<double> w(r), a(r);
		for(int i = 0; i < r; ++i){
			scanf("%lf%lf", &w[i], &a[i]);
			w[i] *= pi / 180.0;
		}

		for(int i = 0; i < h; ++i){
			int cnt = 0;
			for(int j = 0; j < r; ++j){
				if(check(hs[i], us, du, ms, dm, ss, ds, a[j], w[j])){
					++cnt;
				}
			}

			if(cnt > mincnt){
				mincnt = cnt;
				ans.clear();
			}
			if(cnt == mincnt){
				ans.push_back(i + 1);
			}
		}
		
		if(ans.empty()){
			puts("NA");
		}
		else{
			printf("%d", ans[0]);
			for(int i = 1; i < ans.size(); ++i){
				printf(" %d", ans[i]);
			}
			puts("");
		}
	}
}