1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
#pragma GCC optimize("O3")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
 
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> oset;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }

template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }

#ifdef LOCAL
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif

const ll mod = 998244353;
const ll infi  = 1e18+1;
const ld eps = 1e-14L;

int main(){
    //ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    str s; cin >> s;
    int n, m; cin >> n >> m;
    vector<vector<pair<int,int>>> adj(n);
    for(int i=0;i<m;i++){
        int a, b, c; cin >> a >> b >> c;
        a--; b--;
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }
    vector<int> dist(n, 1e9), used(n),ans(n);
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    dist[0] = 0;
    pq.push({0, 0});

    auto sprawdz = [&](int d, int v) -> pair<int,int> {
        int d2 = 0, v2 = 0;
        if(d == 0 && v == 0) return {0, 0};
        for(int bit=0;bit<9;bit++){
            cout << "+ " << ((d>>bit) & 1) << endl;
        }
        for(int bit=0;bit<9;bit++){
            cout << "?" << endl;
            int x; cin >> x;
            if(x) d2 += (1<<bit);
        }
        if(d > d2 || (d == d2 && s == "Algosia")){
            for(int bit=0;bit<11;bit++){
                cout << "?" << endl;
                int x; cin >> x;
                if(x) v2 += (1<<bit);
            }
            return {d2, v2};
        } else {
            for(int bit=0;bit<11;bit++){
                cout << "+ " << ((v>>bit) & 1) << endl;
            }
            return {d, v};
        }
    };
    int processed = 0;
    int last = 0;
    while(processed < n){
        while(!pq.empty()){
            auto [d, v] = pq.top();
            if(used[v] || d > dist[v]){
                pq.pop();
                continue;
            }
            break;
        }
        auto [d2, v2] = (pq.empty() ? make_pair(501, n) : pq.top());
        auto [d, v] = sprawdz(v2 == n ? d2 : d2 - last, v2);
        d += last;
        dist[v] = d;
        ans[v] = d;
        used[v] = 1;
        last = d;
        processed++;
        for(auto [u, w] : adj[v]){
            if(!used[u] && dist[u] > dist[v] + w){
                dist[u] = dist[v] + w;
                pq.push({dist[u], u});
            }
        }

    }
    if(s == "Algosia"){
        cout << "! ";
        for(auto e : ans) cout << e << " ";
        cout << endl;
    }
    return 0;
}