#include<cstdio>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#define fin freopen("in.txt", "r", stdin)
#define fout freopen("out.txt", "w", stdout)
#define pr(x) cout << #x << " : " << x << "   "
#define prln(x) cout << #x << " : " << x << endl
#define Min(a, b) a < b ? a : b
#define Max(a, b) a < b ? b : a
typedef long long ll;
typedef unsigned long long llu;
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const double pi = acos(-1.0);
const double EPS = 1e-6;
const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1};
const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1};
const ll MOD = 1e9 + 7;
using namespace std;#define NDEBUG
#include<cassert>
const int MAXN = 1000 + 10;
const int MAXT = 10000 + 10;char s[MAXT][110];struct Node{int id, len, num[30];char head;Node(int ids, int le) : id(ids), len(le){memset(num, 0, sizeof num);for(int i = 0; i < len; ++i)++num[s[id][i] - 'a'];head = s[id][0];}
};int T, n, plen, d[MAXN], last[MAXN], thisidx[MAXN], thisidy[MAXN], o[MAXN][30];
char p[MAXN];
vector<Node> vec[30];inline bool judge(Node &u, int l, int r){if(l == 0){for(int i = 0; i < 26; ++i)if(u.num[i] != o[r][i])  return false;return true;}else{for(int i = 0; i < 26; ++i)if(u.num[i] != o[r][i] - o[l - 1][i])  return false;return true;}
}void init(){for(int i = 0; i < 26; ++i)  vec[i].clear();memset(d, 0, sizeof d);memset(thisidy, 0, sizeof thisidx);memset(thisidx, 0, sizeof thisidy);memset(last, -1, sizeof last);memset(o[0], 0, sizeof o[0]);++o[0][p[0] - 'a'];for(int i = 1; i < plen; ++i){for(int j = 0; j < 26; ++j)  o[i][j] = o[i - 1][j];++o[i][p[i] - 'a'];}
}int main(){scanf("%d", &T);while(T--){scanf("%s", p);plen = strlen(p);init();scanf("%d", &n);for(int i = 0; i < n; ++i){scanf("%s", s[i]);int le = strlen(s[i]);vec[s[i][le - 1] - 'a'].push_back(Node(i, le));}for(int i = 0; i < plen; ++i){int lur = p[i] - 'a';for(int j = 0; j < vec[lur].size(); ++j){Node &u = vec[lur][j];int tmp = i - u.len + 1;if(tmp == 0 && u.head == p[tmp] && judge(u, tmp, i)){++d[i];thisidx[i] = lur;thisidy[i] = j;}else if(tmp > 0 && u.head == p[tmp] && judge(u, tmp, i) && d[tmp - 1]){d[i] += d[tmp - 1];last[i] = tmp - 1;thisidx[i] = lur;thisidy[i] = j;}}}if(!d[plen - 1])  printf("impossible\n");else if(d[plen - 1] > 1)  printf("ambiguous\n");else{bool flag = false;stack<pair<int, int> > st;for(int i = plen - 1; i != -1; i = last[i])st.push(pair<int, int>(thisidx[i], thisidy[i]));while(!st.empty()){if(flag)  printf(" ");pair<int, int> tmp = st.top();  st.pop();printf("%s", s[vec[tmp.first][tmp.second].id]);flag = true;}printf("\n");}}return 0;
}

#include<cstdio>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#define fin freopen("in.txt", "r", stdin)
#define fout freopen("out.txt", "w", stdout)
#define pr(x) cout << #x << " : " << x << "   "
#define prln(x) cout << #x << " : " << x << endl
#define Min(a, b) a < b ? a : b
#define Max(a, b) a < b ? b : a
typedef long long ll;
typedef unsigned long long llu;
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const double pi = acos(-1.0);
const double EPS = 1e-6;
const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1};
const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1};
const ll MOD = 1e9 + 7;
using namespace std;#define NDEBUG
#include<cassert>
const int MAXN = 1000 + 10;
const int MAXT = 10000 + 10;struct Node{string aftersort;int id, len;char head;Node(string &s, int ids){id = ids;len = s.length();aftersort = s;if(len > 3)  sort(aftersort.begin() + 1, aftersort.end() - 1);head = aftersort[0];}
};int T, n, plen, d[MAXN], last[MAXN], thisidx[MAXN], thisidy[MAXN];
string s[MAXT], p;
vector<Node> vec[30];inline bool judge(Node &u, int i){string tmp = p.substr(i, u.len);if(u.len >= 3)  sort(tmp.begin() + 1, tmp.end() - 1);return tmp == u.aftersort;
}void init(){for(int i = 0; i < 26; ++i)  vec[i].clear();memset(d, 0, sizeof d);memset(thisidy, 0, sizeof thisidx);memset(thisidx, 0, sizeof thisidy);memset(last, -1, sizeof last);
}int main(){scanf("%d", &T);while(T--){init();cin >> p;plen = p.length();scanf("%d", &n);for(int i = 0; i < n; ++i){cin >> s[i];vec[*s[i].rbegin() - 'a'].push_back(Node(s[i], i));}for(int i = 0; i < plen; ++i){int lur = p[i] - 'a';for(int j = 0; j < vec[lur].size(); ++j){Node &u = vec[lur][j];int tmp = i - u.len + 1;if(tmp == 0 && u.head == p[tmp] && judge(u, tmp)){++d[i];thisidx[i] = lur;thisidy[i] = j;}else if(tmp > 0 && u.head == p[tmp] && judge(u, tmp) && d[tmp - 1]){d[i] += d[tmp - 1];last[i] = tmp - 1;thisidx[i] = lur;thisidy[i] = j;}}}if(!d[plen - 1])  printf("impossible\n");else if(d[plen - 1] > 1)  printf("ambiguous\n");else{bool flag = false;stack<pair<int, int> > st;for(int i = plen - 1; i != -1; i = last[i])st.push(pair<int, int>(thisidx[i], thisidy[i]));while(!st.empty()){if(flag)  printf(" ");pair<int, int> tmp = st.top();  st.pop();printf("%s", s[vec[tmp.first][tmp.second].id].c_str());flag = true;}printf("\n");}}return 0;
}