#include<bits/stdc++.h>
#define maxn 10050
#define inf 0x3f3f3f3f
#define LL long long
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mm(a,b) memset(a,b,sizeof(a))
#define mp(a,b) make_pair(a,b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const double eps = 1e-6;
const LL mod=1e9+7;
const LL INF=(LL)1e18;
using namespace std;
LL gcd(LL a,LL b){return b==0?a:gcd(b,a%b);}
LL qpow(LL x,LL y){LL re=1,base=x%mod;while(y){if(y&1)re=(re*base)%mod;base=(base*base)%mod;y>>=1;}return re;}
bool hashh[maxn];
int sg[maxn],s[150];
int t;
void sg_solve(){
	mm(sg,0);
	int j;
	for(int i=1;i<=maxn;i++){
		mm(hashh,0);
		for(j=0;j<t;j++){
			if(i-s[j]>=0) hashh[sg[i-s[j]]]=1;
		}
		for(j=0;j<=maxn;j++){
			if(!hashh[j]) break;
		}
		sg[i]=j;
	}
} 
int main(){
//	freopen("input.txt","r",stdin);
//	freopen("ouput.txt","w",sdout);
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	while(cin>>t){
		if(t==0) break;
		string ans;
		for(int i=0;i<t;i++) cin>>s[i];
		sg_solve();
		int n; cin>>n;
		for(int i=1;i<=n;i++){
			int m;
			cin>>m;
			int res=0;
			for(int j=1;j<=m;j++){
				int h;
				cin>>h;
				res^=sg[h];
			}
			ans+=res?'W':'L';
		}
		cout<<ans<<endl;
	}
	return 0;
}