/*  This Code is Submitted by wywcgs for Problem 2128 on 2006-08-14 at 01:15:35 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 128;
const int HN = 10240;

int main()
{
	int n, s[N], g[HN], gp[HN];
	
	while(scanf("%d", &n) != EOF && n != 0) {
		for(int i = 0; i < n; i++) scanf("%d", &s[i]);
		memset(gp, -1, sizeof(gp));
		for(int i = 0; i < HN; i++) {
			for(int j = 0; j < n; j++)
				if(i-s[j] >= 0) gp[g[i-s[j]]] = i;
			for(int j = 0; true; j++)
				if(gp[j] != i) { g[i] = j; break; }
		}
		int T; scanf("%d", &T);
		for(int t = 0; t < T; t++) {
			int st = 0, pn; scanf("%d", &pn);
			for(int i = 0; i < pn; i++) {
				int p; scanf("%d", &p);
				st ^= g[p];
			}
			putchar(st ? 'W' : 'L');
		}
		putchar('\n');
	}
	
	return 0;
}