영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Consider a game where there are n children (numbered 1,2,…,n) in a circle. During the game, every second child is removed from the circle, until there are no children left.
Your task is to process q queries of the form: "when there are n children, who is the kth child that will be removed?"
Input
The first input line has an integer q: the number of queries.
After this, there are q lines that describe the queries. Each line has two integers n and k: the number of children and the position of the child.
Output
Print q integers: the answer for each query.
Constraints
- 1 ≤ q ≤ 10^5
- 1 ≤ k ≤ n ≤ 10^9
예제
예제 1
4 7 1 7 3 2 2 1337 1313
2 6 1 1107