B'An array is beautiful if both of the following two conditions meet: For example, the array [2, 3, 2, 4, 4, 3, 2] has 3 elements equal to its minimum ( 1 -st, 3 -rd and 7 -th) and 2 elements equal to its maximum ( 4 -th and 5 -th). Another example: the array [42, 42, 42] has 3 elements equal to its minimum and 3 elements equal to its maximum. Your task is to calculate the minimum possible number of elements in a beautiful array. The first line contains one integer t ( 1 <= t <= 5000 ) -- the number of test cases. Each test case consists of one line containing four integers l_1 , r_1 , l_2 and r_2 ( 1 <= l_1 <= r_1 <= 50 ; 1 <= l_2 <= r_2 <= 50 ). For each test case, print one integer -- the minimum possible number of elements in a beautiful array. Optimal arrays in the test cases of the example: '...