#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 #include<iostream>

 #include<map>

 using namespace std;

 const int maxn=;

 int k,n,m;

 int f[maxn+]={};

 int a[]={};

 int vis[maxn+]={};

 int main(){

     while(~scanf("%d",&k)){

         if(!k)break;

         memset(f,-,sizeof(f));

         memset(vis,,sizeof(vis));

         for(int i=;i<=k;i++){

             scanf("%d",&a[i]);

         }f[]=;

         for(int i=;i<=maxn;i++){

             for(int j=;j<=k;j++){

                 if(i-a[j]>=){

                     vis[f[i-a[j]]]=i;

                 }

             }

             for(int j=;j<=maxn;j++){

                 if(vis[j]!=i){

                     f[i]=j;break;

                 }

             }

         }

         scanf("%d",&n);

         int x,y;

         for(int i=;i<=n;i++){

             scanf("%d",&m);y=;

             for(int j=;j<=m;j++){

                 scanf("%d",&x);

                 y^=f[x];

             }

             if(y)printf("W");

             else printf("L");

         }printf("\n");

     }

     return ;

 }