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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
import heapq
import sys
# sys.stdin = open("m.txt", "r")

def sendint(licz):
    for bi in range(16):
        bit = (licz >> bi) & 1
        print('+', bit)

def readint():
    wyn = 0
    for p in range(16):
        print('?', flush=True)
        bb = input()
        
        if bb == '0':
            pass
        elif bb == '1':
            wyn += 2**p
        else:
            print('bład')
    return(wyn)
    
def sendkr(kraw):
    for m1, m2, k in kraw:
        sendint(m1)
        sendint(m2)
        sendint(k)
    sendint(0)
    
def readkr():
    kraw2 = []
    while True:
        m1 = readint()
        if m1 == 0:
            return(kraw2)
        m2 = readint()
        k = readint()
        kraw2.append((m1,m2,k))

def sendmiast2(mk):
    for m in mk:
        if m > 0:
            sendint(m)

    # for i in range(2,len(mk)):
        # sendint(mk[i])
    sendint(0)

def readmiast2():
    mk = []
    while True:
        m1 = readint()
        if m1 == 0:
            return(mk)
        mk.append(m1)

def Algosia():
    miasta, pol = map(int, input().split())
    kraw = []
    for i in range(pol):
        m1, m2, k = map(int, input().split())
        kraw.append((m1,m2,k))
    sendkr(kraw)
    mk = readmiast2()
    print('! 0', end="")
    for i in mk:
        print(' ',i, end="", sep="")
    print(flush=True)


def Bajtek():
    heap = []
    ll = input()
    miasta, pol = map(int, ll.split())
    mk = [-1 for i in range(miasta+1)]
    mk[1] = 0
    mp = [ set() for i in range(miasta+1)]
    odwiedzone = [ False for i in range(miasta+1) ]
    odwiedzone[1] = True
    kraw = {}
    for i in range(pol):
        m1, m2, koszt  = map(int, input().split())
        mp[m1].add(m2)
        mp[m2].add(m1)
        kraw[(m1,m2)] = koszt
        kraw[(m2,m1)] = koszt
    kraw2 = readkr()
    for m1, m2, koszt in kraw2:
        if ((m1, m2) in kraw):
            if  (kraw[(m1,m2)] > koszt):
                kraw[(m1,m2)] = koszt
                kraw[(m2,m1)] = koszt
        else:
            kraw[(m1,m2)] = koszt
            kraw[(m2,m1)] = koszt
            mp[m1].add(m2)
            mp[m2].add(m1)

    for i in mp[1]:
        heapq.heappush(heap, ( kraw[(1,i)], 1, i))

    while heap:
        k, mm1, mm2 = heapq.heappop(heap)
        if not odwiedzone[mm2]:
            mk[mm2] = mk[mm1]+k
            odwiedzone[mm2] = True
            for i in mp[mm2]:
                heapq.heappush(heap, (kraw[(mm2,i)], mm2, i))
        else:
            if mk[mm1]+k < mk[mm2]:
                mk[mm2] = mk[mm1]+k
        
    for i in mp[1]:
        heapq.heappush(heap, ( kraw[(1,i)], 1, i))

    while heap:
        k, mm1, mm2 = heapq.heappop(heap)
        if not odwiedzone[mm2]:
            mk[mm2] = mk[mm1]+k
            odwiedzone[mm2] = True
            for i in mp[mm2]:
                heapq.heappush(heap, (kraw[(mm2,i)], mm2, i))
        else:
            if mk[mm1]+k < mk[mm2]:
                mk[mm2] = mk[mm1]+k

    sendmiast2(mk)


def test():
    
    heap = []
        
    miasta, pol, pol2 = map(int, input().split())
    mk = [-1 for i in range(miasta+1)]
    mk[1] = 0
    mp = [ set() for i in range(miasta+1)]
    odwiedzone = [ False for i in range(miasta+1) ]
    odwiedzone[1] = True
    kraw = {}
    for i in range(pol):
        m1, m2, koszt  = map(int, input().split())
        mp[m1].add(m2)
        mp[m2].add(m1)
        kraw[(m1,m2)] = koszt
        kraw[(m2,m1)] = koszt
    
    for i in range(pol2):
        m1, m2, koszt  = map(int, input().split())
        if ((m1, m2) in kraw) and kraw[(m1,m2)] > koszt:
            kraw[(m1,m2)] = koszt
            kraw[(m2,m1)] = koszt
        else:
            kraw[(m1,m2)] = koszt
            kraw[(m2,m1)] = koszt
            mp[m1].add(m2)
            mp[m2].add(m1)

    print(kraw)

    for i in mp[1]:
        heapq.heappush(heap, ( kraw[(1,i)], 1, i))

    while heap:
        k, mm1, mm2 = heapq.heappop(heap)
        if not odwiedzone[mm2]:
            mk[mm2] = mk[mm1]+k
            odwiedzone[mm2] = True
            for i in mp[mm2]:
                heapq.heappush(heap, (kraw[(mm2,i)], mm2, i))
        else:
            if mk[mm1]+k < mk[mm2]:
                mk[mm2] = mk[mm1]+k
                
        

    print('!', end="")
    for i in range(miasta):
        print(' ',mk[i+1], end="", sep="")
    print(flush=True)
    # print(mp)
    # print(odwiedzone)
    # print(kraw)
    
# test()
def tr2():
    i = 1
    while i!=0:
        i = readint()
        print(i)

def tr():
    kraw2 = readkr()
    print(kraw2)

# test()


def main():
    kto = input()
    if kto == "Algosia":
        Algosia()
    else:
        Bajtek()

main()