불가능이란 없다 n, k = map(int, input().split()) MAX = -1 dist = [-1 for i in range(100001)] def bfs(v): q = [v] dist[v] = 0 nxt_q = [] while q: now = q.pop(0) if now * 2
