#include<cstdio>

 #include<algorithm>

 #define F(i,a,b) for(int i=a;i<=b;i++)

 using namespace std;

 const int N=;

 int sg[N],f[],m,nn,ans,tp;

 int dfs_SG(int x,int *s){

         if(sg[x]!=-)return sg[x];

         bool v[];

         F(i,,)v[i]=;

         F(i,,s[])if(x>=s[i])v[dfs_SG(x-s[i],f)]=;

         F(i,,N)if(!v[i]){sg[x]=i;break;}

         return sg[x];

 }

 int main(){

     while(~scanf("%d",f),f[]){

         F(i,,f[])scanf("%d",f+i);

         sort(f+,f++f[]);

         F(i,,N-)sg[i]=-;

         scanf("%d",&m);

         while(m--){

             scanf("%d",&nn),ans=;

             while(nn--)scanf("%d",&tp),ans^=dfs_SG(tp,f);

             if(ans)printf("W");

             else printf("L");

         }

         puts("");

     }

     return ;

 }