#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

template<class T>
struct Pt {
  T x,y;
  Pt(T x=T(), T y=T()) :x(x),y(y) {}
  void in() {ll _x, _y; input(_x,_y); x=_x; y=_y; }
  bool operator<(const Pt &p) const { return x!=p.x?x<p.x:y<p.y; }
  bool operator==(const Pt &p) const { return x==p.x&&y==p.y; }
  Pt operator+=(const Pt &p) { x+=p.x, y+=p.y; return *this; }
  Pt operator-=(const Pt &p) { x-=p.x, y-=p.y; return *this; }
  Pt operator*=(const Pt &p) { T t=x;x=x*p.x-y*p.y,y=t*p.y+y*p.x; return *this;}
  Pt operator*=(const T &v) { x*=v; y*=v; return *this;}
  friend ostream& operator<<(ostream& os, const Pt &p) {return os<<'('<<p.x<<','<<p.y<<')';}
  friend istream& operator>>(istream& is, Pt &p) {return is>>p.x>>p.y;}

  Pt operator+(const Pt &p) const { return Pt(*this)+=p; }
  Pt operator-(const Pt &p) const { return Pt(*this)-=p; }
  Pt operator*(const Pt &p) const { return Pt(*this)*=p; }
  Pt operator*(const T &v) const { return Pt(*this)*=v; }
  friend Pt operator*(const T &v, const Pt &p) { return p*v; }
  bool operator!=(const Pt &p) const { return !(*this == p); }

  T abs() const { return hypot(x,y); }
  T norm() const { return x*x+y*y; }
  T arg() const { return atan2(y,x); }
  T dot(const Pt &p) const { return x*p.x+y*p.y; }
  T det(const Pt &p) const { return x*p.y-y*p.x; }
  friend T abs(const Pt &p) { return p.abs(); }
  friend T norm(const Pt &p) { return p.norm(); }
  friend T arg(const Pt &p) { return p.arg(); }
  friend T dot(const Pt &p, const Pt &q) { return p.dot(q); }
  friend T det(const Pt &p, const Pt &q) { return p.det(q); }
};

int sig(double r) {return r<-EPS?-1:r>EPS?1:0;}
int sig(ll r) {return r<0?-1:r>0?1:0;}
bool eq(double a, double b) {return sig(a-b)==0;}
bool eq(ll a, ll b) {return a==b;}
Pt<double> pol(double len, double ang) { return Pt<double>(cos(ang),sin(ang)) * len; }

typedef Pt<double> P;

double angle(const P &a, const P &b) {
  double ret = arg(b)-arg(a);
  if (!sig(ret)||!sig(ret-2*PI)) return 0;
  return ret>0 ? ret : ret + 2*PI;
}

template<typename _T>
struct Ci {
  typedef _T T;
  Pt<T> p; T r;
  Ci(const Pt<T> &p, T r) : p(p), r(r) { }
};
typedef Ci<double> C;

// 扇型
struct CS : C {
  P p1, p2;
  CS(const P &p, const P &p1, const P &p2):
    C(p,abs(p1)),p1(p1),p2(p2) {}
};

bool intersectCSP(const CS &cs, const P &p) {
  return angle(cs.p1, p-cs.p) < angle(cs.p1, cs.p2)+EPS &&
    abs(cs.p-p) <= cs.r+EPS;
}

struct Tree {
  P p;
  double d;
  Tree(const P &p, double d) : p(p), d(d) {}
  CS getCS(double w, double a) {
    return CS(p, pol(a, w - d/2), pol(a, w + d/2));
  }
};

int main() {
  int H, R;
  while(input(H,R), H || R) {
    vector<P> home(H);
    REP(i,H) cin >> home[i];
    int U,M,S;
    input(U,M,S);
    double du,dm,ds;
    cin>>du>>dm>>ds;
    du = du / 180 * PI;
    dm = dm / 180 * PI;
    ds = ds / 180 * PI;
    vector<Tree> tree;
    REP(i,U) {
      P p; cin >> p;
      tree.push_back(Tree(p,du));
    }
    REP(i,M) {
      P p; cin >> p;
      tree.push_back(Tree(p,dm));
    }
    REP(i,S) {
      P p; cin >> p;
      tree.push_back(Tree(p,ds));
    }
    vector<int> numday(H);

    Tree mine(P(), du);
    REP(i,R) {
      double w,a;
      cin >> w >> a;
      w = w / 180 * PI;
      CS mycs = mine.getCS(w,a);
      REP(i,home.size()) {
        const P& h = home[i];
        bool ok = intersectCSP(mycs, h);
        if (!ok) continue;
        for (auto &t : tree) {
          CS cs = t.getCS(w,a);
          ok &= !intersectCSP(cs, h);
        }
        if (ok)
          numday[i]++;
      }
    }
    int mx = *max_element(ALL(numday));
    if (mx == 0) puts("NA");
    else {
      bool f = 0;
      REP(i,H) {
        if (numday[i] == mx) {
          if (f) printf(" ");
          printf("%d", i+1);
          f = 1;
        }
      }
      cout << endl;
    }
  }
}

Measured memory_bytes: 1340