SRM_228_Div2_500

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <bitset>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <iterator>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;


vector<string> name;
vector <int> start,speed;
int main() {
    int t,n,aux,dist;string cad;

    scanf("%d",&t);
    while(t--){
        scanf("%d",&dist);
        scanf("%d",&n);getchar();
        for(int i=0;i<n;i++){
            getline(cin,cad);
            name.push_back(cad);
        }
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&aux);start.push_back(aux);
        }
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&aux);speed.push_back(aux);
        }
        double limite=10000.0;
        int index=-1;
        for(int i=0;i<start.size();i++){
            double tiempo=(double)(dist/double(speed[i])) +start[i];
            if(tiempo<limite){
                limite=tiempo;index=i;
            }
        }
        set<int> s;//guardamos orden de eliminación
        vector<pair<double,string> > eliminados;//en vez de structs
        for(int i=0;i<start.size();i++){
            if(i==index) continue;
            if(limite<=double(start[i])){
                eliminados.push_back(make_pair(limite,name[i]));
                s.insert(i);
            }
        }
        vector<double> v(start.size(),100000000.0);/*inicializo vector*/
        for(int i=0;i<start.size();i++){
            for(int j=0;j<start.size();j++){
                if(i!=j && s.count(i)==0 && s.count(j)==0 && start[i]<=start[j]){
                    if(speed[i]>speed[j]){//calculo tiempo de encuentro
                        v[j]=min(v[j],double((dist+speed[i]*start[i]-speed[j]*start[j])/double(speed[i]-speed[j])));
                    }
                    if(speed[j]>speed[i]){
                        v[i]=min(v[i],double((speed[i]*start[i]-speed[j]*start[j])/double(speed[i]-speed[j])));
                    }
                }
            }
        }
        for(int i=0;i<v.size();i++){
            if(v[i]==100000000.0) continue;
            eliminados.push_back(make_pair(v[i],name[i]));/**/
        }
        sort(all(eliminados));
        vector <string> rpta;
        for(int i=0;i<eliminados.size();i++){
            rpta.push_back(eliminados[i].second);
        }
        printf("%d\n",rpta.size());

        for(int i=0;i<rpta.size();i++){
            cout<<rpta[i]<<endl;
        }

        speed.clear();start.clear();name.clear();
    }
    return 0;
}