#include<bits/stdc++.h>

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using namespace std;
template<class A, class B>
ostream& operator<<(ostream& os, const pair<A, B> &p) {
  os << '(' << p.first << ',' << p.second << ')';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &v) {
  os << '{';
  bool osu = 1;
  for(auto &i : v) { if(!osu) os << ','; os << i; osu = 0; }
  os << '}';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const deque<T> &v) {
  os << '{';
  bool osu = 1;
  for(auto &i : v) { if(!osu) os << ','; os << i; osu = 0; }
  os << '}';
  return os;
}
template<class T,long long unsigned int size>
ostream& operator<<(ostream& os, const array<T,size> &arr) {
  os << '{';
  bool osu = 1;
  for(auto &i : arr) { if(!osu) os << ','; os << i; osu = 0; }
  os << '}';
  return os;
}

#define ll long long
#define ull unsigned long long
#define lll __int128
#define rep(i,n,N) for(int i=(n);i<=(N);++i)
#define For(i,n,N) for(int i=(n);i< (N);++i)
#define rap(i,n,N) for(int i=(n);i>=(N);--i)
#define rip(i,n,N,V) for(int i=(n);i<=(N);i+=V)
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
//#define le left
//#define ri right
#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define lc (id<<1)
#define rc ((id<<1)|1)
#define debug(x) cout << #x << " -> " << (x) << endl
#define out(x,y) cout << ">> " << (x) << " " << (y) << endl
#define ou3(x,y,z) cout << ">> " << (x) << " " << (y) << " " << (z) << endl
#define mems(x,y) memset(&x,y,sizeof x)
#define memsv(x,y) memset(&x[0], y, sizeof(x[0]) * x.size())
#define popcount __builtin_popcountll
#define clz(x) (1<<(31-__builtin_clz(x)))
#define clzll(x) (1LL<<(63-__builtin_clzll(x)))
#define all(x) x.begin(),x.end()
#define rsort(x) sort(x), reverse(x)
#define revsort(a,b) sort(a,b), reverse(a,b)
#define PQ(T) priority_queue<T>
#define PQr(T) priority_queue<T, vector<T>, greater<T>>
#define permute(x) while(next_permutation(all(x)))
#define distinct(x) x.erase(unique(all(x)),x.end())
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define vll vector<ll>
#define vlll vector<pll>
#define vvll vector<vll>
#define ari(x) array<int,x>
#define arll(x) array<ll,x>
#define ard(x) array<double,x>
#define pii pair<int,int> 
#define pll pair<ll,ll>
#define plll pair<ll,pll>
#define pllll pair<pll,pll>
#define piii pair<int,pii>
#define piiii pair<pii,pii>
#define psi pair<string,int>
#define endl '\n'
const int MAX = 1e3+5;
const int MOD = 1000000007;
const ll MOD2 = 2010405347;
const ll INF = 2e18;
const int dr[]={1,-1,0,0,1,1,-1,-1};
const int dc[]={0,0,-1,1,1,-1,1,-1};
const double pi = acos(-1);
const double EPS = 1e-9;
const int block = 500;
inline ll pw(ll x,ll y,ll md=MOD){ll ret=1;x%=md;while(y){if(y&1)ret=ret*x%md;x=x*x%md,y>>=1;}return ret;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,q,cv[128];
char vc[37];
string s;
bool st[MAX];
vector<string> g[2];
ari(2) x[MAX], id;

struct trie{
	int nx[37],eow=0,sz=0;
}tr[MAX*10][2];

struct triee{
	vector<pair<int,char>> nx;
	int sz,eow,val;
}v[MAX*10][2];

void ins(int z){
	int nw;
	rep(o,0,1){
		nw = 0;
		for(auto i:s){
			if(!tr[nw][o].nx[i])tr[nw][o].nx[i] = ++id[o];
			nw = tr[nw][o].nx[i];
			tr[nw][o].sz++;
		}
		tr[nw][o].eow = z;
		if(!o)reverse(all(s));
	}
	return;
}

void dfs(int nw,int o){
	v[nw][o].val = st[v[nw][o].eow];
	for(auto i:v[nw][o].nx){
		dfs(i.fi, o);
		v[nw][o].val+= v[i.fi][o].val;
	}
	return;
}

string bt;
void dfs2(int nw,int o,int at){
	if(!at && v[nw][o].val==v[nw][o].sz){
		++id[o];
		at = id[o];
		g[o].pb(bt);
	}
	if(st[v[nw][o].eow]){
		if(at){
			x[v[nw][o].eow][o] = at;
		}
		else {
			++id[o];
			bt+= ' ';
			g[o].pb(bt);
			x[v[nw][o].eow][o] = id[o];
			bt.pob();
		}
	}
	for(auto i:v[nw][o].nx){
		bt+= i.se;
		dfs2(i.fi, o, at);
		bt.pob();
	}
	return;
}

namespace MCBM{
	int match[MAX];
	int vis[MAX], cl;
	vi v[MAX];
	int aug(int l) {
		if(vis[l]==cl) return 0;
		vis[l] = cl;
		for(auto r : v[l]) if(match[r] == -1 || aug(match[r])) {
			match[r] = l;
			return 1;
		}
		return 0;
	} // do not forget to reset vis[]
	
	vi cover(int n, int m) { // Backtrack mincover
		mems(match, -1);
		int res = 0;
		rep(i, 1, n)++cl, res += aug(i);
		vector<bool> lfound(n + 1, true), seen(m + 1, false);
		rep(i, 1, m) if(match[i] != -1) lfound[match[i]] = false;
		vi q, cover;
		rep(i, 1, n) if(lfound[i]) q.pb(i);
		while(!q.empty()) {
			int i = q.back();
			q.pop_back();
			lfound[i] = 1;
			for(int e : v[i]) if(!seen[e] && match[e] != -1) {
				seen[e] = true;
				q.pb(match[e]);
			}
		}
		rep(i, 1, n) if(!lfound[i]) cover.pb(i);
		rep(i, 1, m) if(seen[i]) cover.pb(n + i);
		assert(cover.size() == res);
		return cover;
	}
}

int cl,gg[MAX][MAX];

int main(){
//	cout<<fixed<<setprecision(10);
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt","w",stdout);
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int ii = 0;
	rep(i,'A','Z')cv[i] = ii, vc[ii] = i, ii++;
	rep(i,'0','9')cv[i] = ii, vc[ii] = i, ii++;
	cv['-'] = ii, vc[ii] = '-';
	cin>>n>>q;
	rep(i,1,n){
		cin>>s;
		for(auto &i:s)i = cv[i];
		ins(i);
	}
	rep(o,0,1){
		rep(i,0,id[o]){
			v[i][o].sz = tr[i][o].sz;
			v[i][o].eow = tr[i][o].eow;
			rep(j,0,36)if(tr[i][o].nx[j]){
				v[i][o].nx.pb({tr[i][o].nx[j], vc[j]});
			}
		}
	}
	int k,a;
	while(q--){
		cin>>k;
		mems(st, 0);
		rep(i,1,k){
			cin>>a;
			st[a] = 1;
		}
		if(k==n){
			cout<<n*1000+1<<" 1 *\n";
			continue;
		}
		else if(k==0){
			cout<<"0 0\n";
			continue;
		}
//		cout<<"---\n";
		rep(o,0,1){
			g[o] = {""};
			id[o] = 0;
			dfs(0, o);
			dfs2(0, o, 0);
			for(auto &i:g[o]){
				if(i.back()!=' ')i = i + "*";
				else i.pob();
				if(o)reverse(all(i));
			}
//			debug(g[o]);
//			debug(id[o]);
		}
		++cl;
		rep(i,1,n)MCBM::v[i].clear();
		rep(i,1,n)if(st[i] && gg[x[i][0]][x[i][1]]!=cl){
			gg[x[i][0]][x[i][1]] = cl;
			MCBM::v[x[i][0]].pb(x[i][1]);
		}
		vi ans = MCBM::cover(id[0], id[1]);
		cout<<k*1000+ans.size()<<" "<<ans.size();
		for(auto i:ans){
			if(i<=id[0])cout<<" "<<g[0][i];
			else {
				i-= id[0];
				cout<<" "<<g[1][i];
			}
		}
		cout<<endl;
	}
	return 0;
}