fudq's AC Road

/*
 * pro.cpp
 *
 *  Created on: 2013-10-12
 *      Author: fudq
 */
#include <functional>
#include <algorithm>
#include <iostream>
//#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,102400000")

#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define LL long long

const int N=105;
const int M=32010;
const int MOD=1000000007ll;
const int INF=0x7fffffff;
const int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
//const int dir[8][2]={{-1,0},{1,0},{0,-1},{0,1},{-1,1},{1,-1},{-1,-1},{1,1}};
const double eps=1e-16;
const double PI=acos(-1.0);

inline int sign(double x){return (x>eps)-(x<-eps);}
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T lcm(T a,T b,T d){return a/d*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);}
template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);}
template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));}
template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));}
/*************************/

int s[110],f[10010];

int sg(int a,int k)
{
	int mex[110];
	MEM(mex);
	if(f[a] != -1)
		return f[a];
	if(a < s[0])
		return f[a]=0;
	for(int i=0;i<k && a>=s[i];i++)
	{
		int tmp=sg(a-s[i],k);
		mex[tmp]=1;
	}
	for(int i=0;;i++)
		if(!mex[i])
			return f[a]=i;
}

void solve(int k)
{
	int T,n,ans,h;
	for(int i=0;i<k;i++)
		scanf("%d",&s[i]);
	sort(s,s+k);
	memset(f,-1,sizeof(f));
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		ans=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&h);
			ans=ans^sg(h,k);
		}
		if(!ans)
			printf("L");
		else
			printf("W");
	}
	printf("\n");
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("testin.txt", "r", stdin);
    //freopen("textout.txt", "w", stdout);
#endif
    int k;
    while(scanf("%d",&k)!=EOF && k)
    	solve(k);
    return 0;
}