#include <bits/stdc++.h>
using namespace std;
//define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define fi first
#define se second
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a,b) (abs((a)-(b)) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
//template
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
  os << "(" << p.first << "," << p.second << ")";return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
  for (auto it = v.begin();it != v.end();++it){
    if(it != v.begin())os << " ";os << *it;
      }return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp){
  for(auto x: mp)os << "(" << x.first << "," << x.second << ")" << endl;
  return os;
}
template<typename T, int SIZE>
int array_length(const T (&)[SIZE]){return SIZE;}
template<typename T, int N>
void PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true){
	if(t == -1){rep(i,s){if(i)cout << " ";cout << a[i];}}
	else repi(i,s,t){if(i!=s)cout << " ";cout << a[i];}
	if(f)cout << "\n";
}
template<typename T, int N1, int N2>
void PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2){
	rep(i,h){rep(j,w){cout << a[i][j] << " \n"[j==w-1];}}
}
//typedef
typedef complex<double> Point;
typedef pair<int,int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;


double cross(Point a, Point b) {
  return (a.real() * b.imag() - a.imag() * b.real());
}
double to_rad(double deg){return (deg/180*M_PI);}
double to_deg(double rad){return (rad/M_PI*180);}

P a[100];
bool Hit(P h, P b, int R, int r, int d){
  Point H(h.fi, h.se);
  Point B(b.fi, b.se);
  if(abs(H-B)-d > -EPS)return false;
  Point l1(cos(to_rad(R+r/2.0)), sin(to_rad(R+r/2.0)));
  Point l2(cos(to_rad(R-r/2.0)), sin(to_rad(R-r/2.0)));
  if(cross(H-B, l1) > -EPS and cross(l2, H-B) > -EPS)return true;
  // if(h == P(5, 2) and b == P(2, -2)){
  //   cout << "+ " << R << " " << r << " " << cos(R+r/2.0) << " " << l2 << endl;
  //   cout << arg(l1)/M_PI*180 << endl;
  // }
  return false;
}

signed main(){
  while(1){
    int N, M;
    scanf("%lld%lld", &N, &M);
    if(N == 0 and M == 0)break;
    rep(i,N){
      int x, y;
      scanf("%lld%lld", &x, &y);
      a[i] = P(x, y);
    }
    P b[3][10], R[100];
    int U[3], r[3];
    rep(i,3)scanf("%lld", &U[i]);
    rep(i,3)scanf("%lld", &r[i]);
    rep(i,3){
      rep(j,U[i]){
        int x, y;
        scanf("%lld%lld", &x, &y);
        b[i][j] = P(x, y);
      }
    }
    rep(i,M){
      int x, y;
      scanf("%lld%lld", &x, &y);
      R[i] = P(x, y);
    }
    
    vector<int> vec;
    int mx = 0;
    rep(i,N){
      int cnt = 0;
      rep(day,M){
        bool hit = false;
        rep(j,3)rep(k,U[j]){
          chmax(hit, Hit(a[i], b[j][k], R[day].fi, r[j], R[day].se));
        }
        if(!hit and Hit(a[i], P(0, 0), R[day].fi, r[0], R[day].se))cnt++;
      }
      chmax(mx, cnt);
      vec.pb(cnt);
    }
    // printf("*%lld* ", mx);
    if(mx == 0){printf("NA\n");continue;}
    bool f = false;
    rep(i,N){
      if(vec[i] != mx)continue;
      if(f)printf(" ");
      printf("%lld", i+1);
      f = true;
    }
    printf("\n");
  }
	return 0;
}











Measured memory_bytes: 3632