Two Rival Students

题意翻译

有一排学生排成的长度为$n$的队列，其中有两个竞争者。第一个竞争者在$a$处，第二个竞争者在$b$处。 两个学生的距离是这样定义的：若两学生分别在$p$处及$s$处，那么他们之间的距离是$∣p−s∣$。 你可以任意交换两个位置相邻的学生最多$x$次。 试计算出两个学生在最多交换$x$次之后最长的距离。 $t$ $( 1 \le t \le 100 )$ , $(2 \leq n \leq 100, 0 \leq x \leq 100, 1 \leq a, b \leq n, a \neq b)$

题目描述

You are the gym teacher in the school. There are $ n $ students in the row. And there are two rivalling students among them. The first one is in position $ a $ , the second in position $ b $ . Positions are numbered from $ 1 $ to $ n $ from left to right. Since they are rivals, you want to maximize the distance between them. If students are in positions $ p $ and $ s $ respectively, then distance between them is $ |p - s| $ . You can do the following operation at most $ x $ times: choose two adjacent (neighbouring) students and swap them. Calculate the maximum distance between two rivalling students after at most $ x $ swaps.

输入输出格式

输入格式

The first line contains one integer $ t $ ( $ 1 \le t \le 100 $ ) — the number of test cases. The only line of each test case contains four integers $ n $ , $ x $ , $ a $ and $ b $ ( $ 2 \le n \le 100 $ , $ 0 \le x \le 100 $ , $ 1 \le a, b \le n $ , $ a \neq b $ ) — the number of students in the row, the number of swaps which you can do, and positions of first and second rivaling students respectively.

输出格式

For each test case print one integer — the maximum distance between two rivaling students which you can obtain.

输入输出样例

输入样例 #1

3
5 1 3 2
100 33 100 1
6 0 2 3

输出样例 #1

2
99
1

说明

In the first test case you can swap students in positions $ 3 $ and $ 4 $ . And then the distance between the rivals is equal to $ |4 - 2| = 2 $ . In the second test case you don't have to swap students. In the third test case you can't swap students.