Assume you are living with two felines: An and B. There are n resting where the two felines normally rest. Your felines like to rest and furthermore like this load of spots, so they change snoozing spot every hour consistently: Feline A progressions its snoozing place all together: n,n−1,n−2,… ,3,2,1,n,n−1,… at the
Correct answer will be upvoted else downvoted. Computer science.
Assume you are living with two felines: An and B. There are n resting where the two felines normally rest.
Your felines like to rest and furthermore like this load of spots, so they change snoozing spot every hour consistently:
Feline A progressions its snoozing place all together: n,n−1,n−2,… ,3,2,1,n,n−1,… at the end of the day, at the main hour it's on the spot n and afterward goes in diminishing request consistently;
Feline B changes its resting place all together: 1,2,3,… ,n−1,n,1,2,… all in all, at the primary hour it's on the spot 1 and afterward goes in expanding request consistently.
The feline B is a lot more youthful, so they have a severe pecking order: An and B don't lie together. All in all, on the off chance that both cats'd prefer to go in spot x, the A has this spot and B moves to the following submit in its request (assuming x<n, to x+1, however on the off chance that x=n, to 1). Feline B follows his request, so it will not get back to the skipped spot x after A liberates it, yet will move to the spot x+2, etc.
Compute, where feline B will be at hour k?
Input
The principal line contains a solitary integer t (1≤t≤104) — the number of experiments.
The solitary line of each experiment contains two integers n and k (2≤n≤109; 1≤k≤109) — the number of spots and hour k.
Output
For each experiment, print one integer — the record of where feline B will rest at hour k.
Step by step
Solved in 4 steps with 1 images
