#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 1000000000000000000;
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
template <typename first, typename second>
ostream &operator<<(ostream &os, const pair<first, second> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const map<first, second> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
void solve() {
  string s, a, b, c;
  int n;
  cin >> s;
  n = s.size();
  for (int i = 0; i < n; i++) {
    if (s[i] == ';' || s[i] == '-' || s[i] == '_') continue;
    a += tolower(s[i]);
  }
  cin >> s;
  n = s.size();
  for (int i = 0; i < n; i++) {
    if (s[i] == ';' || s[i] == '-' || s[i] == '_') continue;
    b += tolower(s[i]);
  }
  cin >> s;
  n = s.size();
  for (int i = 0; i < n; i++) {
    if (s[i] == ';' || s[i] == '-' || s[i] == '_') continue;
    c += tolower(s[i]);
  }
  vector<string> v;
  v.push_back(a + b + c);
  v.push_back(a + c + b);
  v.push_back(b + a + c);
  v.push_back(b + c + a);
  v.push_back(c + a + b);
  v.push_back(c + b + a);
  int q;
  cin >> q;
  while (q--) {
    cin >> s;
    string p;
    n = s.size();
    for (int i = 0; i < n; i++) {
      if (s[i] == ';' || s[i] == '-' || s[i] == '_') continue;
      p += tolower(s[i]);
    }
    bool f = true;
    for (int i = 0; i < 6; i++) {
      if (v[i] == p) {
        cout << "ACC\n";
        f = false;
        break;
      }
    }
    if (f) cout << "WA\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  solve();
  return 0;
}
