1 #include<iostream>
 2 #include<string>
 3 #include<cstdio>
 4 #include<vector>
 5 #include<queue>
 6 #include<stack>
 7 #include<set>
 8 #include<algorithm>
 9 #include<cstring>
10 #include<stdlib.h>
11 #include<math.h>
12 using namespace std;
13 #define ll __int64
14 int sg[11000],ss[110],k;
15 int getsg(int n){
16         int vit[110];
17         memset(vit,0,sizeof(vit));
18         for(int j=0;j<k&&ss[j]<=n;j++){
19              if(sg[n-ss[j]]==-1) sg[n-ss[j]]=getsg(n-ss[j]);
20              vit[sg[n-ss[j]]]=1;
21         }
22         for(int j=0;;j++)
23         if(!vit[j]) return j;
24 }
25 int main(){
26     while(scanf("%d",&k)&&k){
27         for(int i=0;i<k;i++) scanf("%d",&ss[i]);
28         sort(ss,ss+k);
29         int m;scanf("%d",&m);
30         memset(sg,-1,sizeof(sg));
31         sg[0]=0;
32         while(m--){
33             int ans=0,t;scanf("%d",&t);
34             while(t--){
35                 int tt;scanf("%d",&tt);
36                 if(sg[tt]==-1) sg[tt]=getsg(tt);
37                 ans^=sg[tt];
38             }
39             if(ans==0) printf("L");
40             else printf("W");
41         }
42         printf("\n");
43     }
44 }