B'This is an interactive problem. Chouti was tired of studying, so he opened the computer and started playing a puzzle game. Long long ago, the boy found a sequence s_1, s_2, ldots, s_n of length n , kept by a tricky interactor. It consisted of 0 s and 1 s only and the number of 1 s is t . The boy knows nothing about this sequence except n and t , but he can try to find it out with some queries with the interactor. We define an operation called flipping. Flipping [l,r] ( 1 <= q l <= q r <= q n ) means for each x in [l,r] , changing s_x to 1-s_x . In each query, the boy can give the interactor two integers l,r satisfying 1 <= q l <= q r <= q n and the interactor will either flip [1,r] or [l,n] (both outcomes have the same probability and all decisions made by interactor are independent from each other, see Notes section for more details). The interactor will tell the current number of 1 s after each operation. Note, that the sequence won 't be restored after each operation. Help the boy to find the original sequence in no more than 10000 interactions. "Weird legend, dumb game." he thought. However, after several tries, he is still stuck with it. Can you help him beat this game? The interaction starts with a line containing two integers n and t ( 1 <= q n <= q 300 , 0 <= q t <= q n ) -- the length of the sequence and the number of 1 s in it. After that, you can make queries. To make a query, print a line "? l r" ( 1 <= q l <= q r <= q n ), then flush the output. After each query, read a single integer t ( -1 <= q t <= q n ). When you found the original sequence, print a line "! s", flush the output and terminate. Print s_1, s_2, ldots, s_n as a binary string and do not print spaces in between. Your solution will get Idleness Limit Exceeded if you don 't print anything or forget to flush the output. To flush you'...