import collections
import heapq
import sys
import math
import itertools
import bisect
from io import BytesIO, IOBase
import os
def valid(i,j,n,m):
if i<n and i>=0 and j>=0 and j< m :return True return False
def sumn(i,n):
return (n-i)*(i+n)/2
def sqfun(a,b,c):
return (-b+math.sqrt(b*b-4*a*c))/2*a
def value(): return tuple(map(int, input().split()))
def values(): return tuple(map(int, sys.stdin.readline().split()))
def inlst(): return [int(i) for i in input().split()]
def inlsts(): return [int(i) for i in sys.stdin.readline().split()]
def inp(): return int(input())
def inps(): return int(sys.stdin.readline())
def instr(): return input()
def stlst(): return [i for i in input().split()]
def f(s):
r=''
for i in s:
if i not in ['-',';','_']:r+=i.lower()
return r
def solve():
l=[]
for i in range(3):
l.append(f(input()))
t=itertools.permutations(l,len(l))
l=[]
for i in t:l.append("".join(i))
for i in range(inp()):
if f(instr()) in l:print ('ACC')
else:print ('WA')
if __name__ == "__main__":
solve()
#include <iostream>
#include<vector>
#include <algorithm>
#include<string>
using namespace std;
char lowercase(char &c)
{
if(c>='a'&&c<='z')
{
return c;
}
return c - ('A'-'a');
}
string clean(string &s)
{
string ans = "";
for(auto i:s)
{
if(i != '-' && i != ';' && i != '_' )
{
ans.push_back(lowercase(i));
}
}
return ans;
}
void solve()
{
string a,b,c;
cin>>a>>b>>c;
a = clean(a);
b = clean(b);
c = clean(c);
int n;
cin>>n;
for(int i=0;i<n;i++)
{
string in;
cin>>in;
in = clean(in);
if(in != a+b+c && in != b+a+c && in != c+a+b && in != c+b+a && in != a+c+b && in != b+c+a)
{
cout<< "WA"<<endl;
}
else
{
cout<< "ACC" <<endl;
}
}
}
int main() {
int t;
t = 1;
for(int i=0;i<t;i++)
{
solve();
}
}WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |