#include <stdio.h>
#include <time.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <map> 
#include <string>
#include <vector>  
#include <iostream> 
#include <sstream> 
#include <queue>
#include <algorithm>
#include <assert.h>
#include <set>


using namespace std;

#define ll long long
#define PB 		push_back
#define FOR(a,start,end) 	for(int a=int(start); a<int(end); a++)
#define INF 		INT_MAX
#define SORT(a) 	sort(a.begin(),a.end()) 
#define CL(a,x) 		memset(a,x,sizeof(a))
#define REP(a,x)	for(int a=0;a<x;a++)
#define REP1(a,x)	for(int a=1;a<=x;a++)
#define MP 		make_pair



typedef vector<ll>     vi;
typedef pair<ll, ll>     pii;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vector<ll> > vvi;
typedef vector<vector<string> > vvs;
typedef vector<pair<string, string> > vss;
typedef pair<string, string> pss;
typedef pair<ll, pii> ppii;
typedef vector<ppii> vppii;
typedef vector<vector<pii> > vvii;
typedef vector<vvi> vvvi;


ll  n, k, q, d, r, g, b, z, p, a, c, m;

vi vk, va,vd;
vvi vvd, vva0, vvk;
vii vax,vcx;
vvii vvax,vvbx;
pii p1, p2;
string w;
int ik;
priority_queue<pii> pq;
vector<bool> vb;
void nad(int c, int k) {//k-ilosc bitów
	for (int i = 0; i < k; i++) {
		cout << "+ " << c % 2 << '\n';
		c /= 2;
		cout.flush();
	}
}
int odb(int k) {//k-ilosc bitów
	vi va; va.assign(k, 0);
	int z = 0;
	int q = 1;
	for (int i = 0; i < k; i++) {
		cout << '?' << '\n';
		cout.flush();
		cin >> va[i];
	}
	for (int i = 0; i < k; i++) {
		z += q * va[i];
		q *= 2;
	}
	return z;
}
pii podb() {
	pii p1;
	p1.first = odb(9);//koszt
	if (p1.first == 511)
		return MP(-1, -1);
	p1.second = odb(11);//nr miasta
	return p1;
}
vii nadodb(int c) {
	vcx.clear();
	nad(c, 11);
	pii p1 = podb();
	if (p1.first > 0) {
		vcx.push_back(p1);
	//	p1 = podb();
	}
	return vcx;
}
void odbnad() {
	int c = odb(11);
	vb[c] = true;
	if((int)vvbx[c].size()>0){
	//for (int i = 0; i < (int)vvbx[c].size(); i++) {
		//if (!vb[vvbx[c][i].second]) {
			nad(vvbx[c][0].first, 9);
			nad(vvbx[c][0].second, 11);
			
		//}
	}
	else {
		nad(511, 9);
	}
}
int main() {
	//freopen("c:\\wojtek\\uva\\pa\\debug\\t1.in", "rt", stdin);
	//freopen("c:\\cygwin64\\home\\plwokow\\.check_sol\\zb1\\in\\320.in", "rt", stdin);
	//d = 1000000007;
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	
	cin >> w;
	
	if (w[0] == 'A') {
		vax.clear();
		
		cin >> n>>a;
		vvax.assign(n + 1, vax);
		for (int i = 0; i < a; i++) {
			cin >> c >> d >> g;
			vvax[c].push_back(MP(-g, d));
			vvax[d].push_back(MP(-g, c));
		}
		vb.assign(n + 1, false);
		while (!pq.empty())
			pq.pop();
		for (int i = 0; i < (int)vvax[1].size(); i++) {
			pq.push(vvax[1][i]);
		}
		for (int i = 2; i <= n; i++)
			pq.push(MP(-1000000, i));
		vcx=nadodb(1);
		for (int i = 0; i < (int)vcx.size(); i++) {
			pq.push(MP(-vcx[i].first,vcx[i].second));
		}
		vd.assign(n + 1, 0);
		vd[1] = 0;
		vb[1] = true;
		while (!pq.empty()) {
			pii p1 = pq.top();
			pq.pop();
			if (vb[p1.second])
				continue;
			p1.first *= -1;
			vb[p1.second] = true;
			vd[p1.second] = p1.first;
			for (int i = 0; i < (int)vvax[p1.second].size(); i++) {
				if(!vb[vvax[p1.second][i].second])
					pq.push(MP(vvax[p1.second][i].first - vd[p1.second], vvax[p1.second][i].second));
			}
			vcx = nadodb(p1.second);
			for (int i = 0; i < (int)vcx.size(); i++) {
				if (!vb[vcx[i].second])
					pq.push(MP(-vcx[i].first - vd[p1.second], vcx[i].second));
				else {
					if (vcx[i].first + vd[vcx[i].second] < vd[p1.second]) {
						vd[p1.second] = vcx[i].first + vd[vcx[i].second];
						for (int i = 0; i < (int)vvax[p1.second].size(); i++) {
							if (!vb[vvax[p1.second][i].second])
								pq.push(MP(vvax[p1.second][i].first - vd[p1.second], vvax[p1.second][i].second));
						}
						//pq.push(MP(-vcx[i].first - vd[vcx[i].second], p1.second));
					}
				}
			}
		}
		cout << '!';
		for (int i = 1; i <= n; i++)
			cout << ' ' << vd[i];
		cout << '\n';
		cout.flush();

	}
	else {
		vax.clear();
		
		cin >> n >> b;
		vvbx.assign(n + 1, vax);
		for (int i = 0; i < b; i++) {
			cin >> c >> d >> g;
			vvbx[c].push_back(MP(g, d));
			vvbx[d].push_back(MP(g, c));
		}

		vb.assign(n + 1, false);
		for (int i = 1; i <= n; i++) {
			SORT(vvbx[i]);
		}
		for(int i=0;i<n;i++)
			odbnad();
	}
	//cout.flush();
	//}
	return 0;

}