class Node:
    def __init__(self, x):
        self.x = x

    def __lt__(self, o):
        print('?',self.x,o.x,flush=True)
        res = int(input())
        if res == -1: exit(0)
        return res == o.x
    
n, k = map(int, input().split())
topk = sorted(range(1,n+1), key=Node)
print('!',*topk[-k:])