B"There is a road with length l meters. The start of the road has coordinate 0 , the end of the road has coordinate l . There are two cars, the first standing at the start of the road and the second standing at the end of the road. They will start driving simultaneously. The first car will drive from the start to the end and the second car will drive from the end to the start. Initially, they will drive with a speed of 1 meter per second. There are n flags at different coordinates a_1, a_2, ldots, a_n . Each time when any of two cars drives through a flag, the speed of that car increases by 1 meter per second. Find how long will it take for cars to meet (to reach the same coordinate). The first line contains one integer t ( 1 <= q t <= q 10^4 ): the number of test cases. The first line of each test case contains two integers n , l ( 1 <= q n <= q 10^5 , 1 <= q l <= q 10^9 ): the number of flags and the length of the road. The second line contains n integers a_1, a_2, ldots, a_n in the increasing order ( 1 <= q a_1 < a_2 < ldots < a_n < l ). It is guaranteed that the sum of n among all test cases does not exceed 10^5 . For each test case print a single real number: the time required for cars to meet. Your answer will be considered correct, if its absolute or relative error does not exceed 10^{-6} . More formally, if your answer is a and jury's answer is b , your answer will be considered correct if frac{|a-b|}{ max{(1, b)}} <= q 10^{-6} . In the first test case cars will meet in the coordinate 5 . The first car will be in the coordinate 1 in 1 second and after that its speed will increase by 1 and will be equal to 2 meters per second. After 2 more seconds it will be in the coordinate 5 . So, it will be in the coordinate 5 in 3 seconds. The second car will be in the coordinate 9 in $"...