#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define fs first
#define sc second
#define mp make_pair
#define mt make_tuple
#define _bit __builtin_popcount
#define _ctz __builtin_ctz
#define _bitll __builtin_popcountll
#define _ctzll __builtin_ctzll
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define y0 y0Elsweyr
#define y1 y1Elsweyr
using namespace std;
using namespace __gnu_pbds;
void usecin() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}

typedef long double dbl;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<dbl> vd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef tuple<int, int, int> iii;
typedef pair<dbl, dbl> pdd;
typedef pair<dbl, ll> pdll;
typedef complex<dbl> cd;
typedef tree<int, null_type, less<int>, rb_tree_tag,
    tree_order_statistics_node_update> ost;

const int N=128;
pii s[N];
int ans[N];

void solve(int L, int R, int l, int r) {
    if(L>R) return;
    if(l>r || (l==r && l==1)) {
        if(l>r) l--;
        for(; L<=R; L++)
            ans[s[L].sc]=l;
        return;
    }
    int m=(l+r)/2;
    int x;
    printf("Q %d\n", m);
    fflush(stdout);
    scanf("%d", &x);
    int M=lower_bound(s+L, s+R+1, pii(x, -1))-s;
    solve(L, M-1, l, m-1);
    for(; s[M].fs==x; M++)
        ans[s[M].sc]=m;
    solve(M, R, m+1, r);
}

int main() {
    int i, n, m;
    scanf("%d%d", &n, &m);
    assert(m<=N);
    for(i=0; i<m; i++) {
        scanf("%d", &s[i].fs);
        s[i].sc=i;
    }
    sort(s, s+m);
    solve(0, m-1, 1, n);
    printf("A");
    for(i=0; i<m; i++)
        printf(" %d", ans[i]);
    printf("\n");
    return 0;
}