#line 2 "library/template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#line 2 "library/template/macro.hpp"
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";
#line 6 "library/template/template.hpp"

#line 2 "library/template/util.hpp"
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <class T, class S = T>
S SUM(const vector<T>& a) {
  return accumulate(ALL(a), S(0));
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template <class T>
int popcnt(T x) {
  return __builtin_popcountll(x);
}
template <class T>
int topbit(T x) {
  return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <class T>
int lowbit(T x) {
  return (x == 0 ? -1 : __builtin_ctzll(x));
}
#line 8 "library/template/template.hpp"

#line 2 "library/template/inout.hpp"
struct Fast {
  Fast() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} fast;

ostream& operator<<(ostream& os, __uint128_t x) {
  char buf[40];
  size_t k = 0;
  while (x > 0) buf[k++] = (char)(x % 10 + '0'), x /= 10;
  if (k == 0) buf[k++] = '0';
  while (k) os << buf[--k];
  return os;
}
ostream& operator<<(ostream& os, __int128_t x) {
  return x < 0 ? (os << '-' << (__uint128_t)(-x)) : (os << (__uint128_t)x);
}
template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << " " << p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& a) {
  for (auto& v : a) is >> v;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& st) {
  os << "{";
  for (auto it = st.begin(); it != st.end();) {
    os << *it;
    if (++it != st.end()) os << ",";
  }
  os << "}";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& mp) {
  os << "{";
  for (auto it = mp.begin(); it != mp.end();) {
    os << it->first << ":" << it->second;
    if (++it != mp.end()) os << ",";
  }
  os << "}";
  return os;
}

void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T& t, const U&... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

namespace IO {
namespace Graph {
vector<vector<int>> unweighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    u -= offset, v -= offset;
    g[u].push_back(v);
    if (!directed) g[v].push_back(u);
  }
  return g;
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<pair<int, T>>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    T w;
    cin >> u >> v >> w;
    u -= offset, v -= offset;
    g[u].push_back({v, w});
    if (!directed) g[v].push_back({u, w});
  }
  return g;
}
}  // namespace Graph
namespace Tree {
vector<vector<int>> unweighted(int n, bool directed = false, int offset = 1) {
  return Graph::unweighted(n, n - 1, directed, offset);
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, bool directed = false, int offset = 1) {
  return Graph::weighted<T>(n, n - 1, directed, offset);
}
vector<vector<int>> rooted(int n, bool to_root = true, bool to_leaf = true, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 1; i < n; i++) {
    int p;
    cin >> p;
    p -= offset;
    if (to_root) g[i].push_back(p);
    if (to_leaf) g[p].push_back(i);
  }
  return g;
}
}  // namespace Tree
}  // namespace IO
#line 10 "library/template/template.hpp"

#line 2 "library/template/debug.hpp"
#ifdef LOCAL
#define debug 1
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define debug 0
#define show(...) true
#endif
template <class T>
void _show(int i, T name) {
  cerr << '\n';
}
template <class T1, class T2, class... T3>
void _show(int i, const T1& a, const T2& b, const T3&... c) {
  for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i];
  cerr << ":" << b << " ";
  _show(i + 1, a, c...);
}
#line 2 "main.cpp"

void solve() {
  // rep(N, 2, 19) rep(M, 4, 12) {
  //   if (3 * N > M * (M + 1) / 2) continue;
  //   vector<ll> dp(N + 1);
  //   dp[0] = 1;
  //   rep(k, 1, M + 1) {
  //     rrep(i, 0, N + 1) {
  //       rep(j, 1, k + 1) {
  //         if (i - j < 0) break;
  //         dp[i] += dp[i - j];
  //       }
  //     }
  //   }
  //   ll z = 1;
  //   rep(_, 0, M) z *= M;
  //   out(N, M, dp[N], z);
  // }

  int pl;
  in(pl);
  int N, M;
  in(N, M);
  vector<int> C(N);
  in(C);

  // rep(i, 0, N - 1) assert(C[i] <= C[i + 1]);
  sort(ALL(C));

  vector<ll> a;
  auto dfs = [&](auto dfs, ll v, int k, int rem) -> void {
    if (k > M) {
      if (rem == 0) a.push_back(v);
    } else {
      ll w = v;
      rep(i, 0, k + 1) {
        if (rem - i < 0) break;
        dfs(dfs, w, k + 1, rem - i);
        w = w * M + k - 1;
      }
    }
  };
  dfs(dfs, 0, 1, N);
  sort(ALL(a));

  // M ** L >= a.size()
  int L = 0;
  for (int p = 1; p < a.size(); p *= M) L++;

  ll z = 0;
  for (auto v : C) z = z * M + v - 1;
  int id1 = LB(a, z);
  int id2 = 0;
  assert(a[id1] == z);

  vector<int> cnt(M + 1, -1);
  {
    int x = id1;
    int p = 1;
    rep(_, 0, L * 2) {
      string t;
      in(t);
      bool turn = t[0] == 'T';
      if (turn) {
        out("ASK", x % M + 1);
        x /= M;
        cout.flush();
      }
      in(t);
      assert(t[0] == 'C');
      int X, K;
      in(X, K);
      cnt[X] = K;
      if (!turn) {
        id2 += p * (X - 1);
        p *= M;
      }
    }
  }

  {
    int x = 1;
    while (true) {
      while (x <= M && cnt[x] != -1) x++;
      if (x > M) break;
      string t;
      in(t);
      if (t[0] == 'T') {
        out("ASK", x);
        cout.flush();
      }
      in(t);
      assert(t[0] == 'C');
      int X, K;
      in(X, K);
      cnt[X] = K;
      assert(X == x);
    }
  }

  show(cnt);
  for (auto v : C) cnt[v]--;
  show(cnt);
  z = a[id2];
  rep(_, 0, N) {
    cnt[z % M + 1]--;
    z /= M;
  }
  show(cnt);

  vector<int> ans;
  rep(v, 1, M + 1) {
    assert(cnt[v] >= 0);
    rep(_, 0, cnt[v]) ans.push_back(v);
  }
  out("GUESS", ans);
  cout.flush();
}

int main() {
  int t = 1;
  // in(t);
  while (t--) solve();
}