Problem: 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, …, 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). 

Input

The first line contains one integer t (1 ≤ t ≤ 10^4): the number of test cases.

The first line of each test case contains two integers n, l (1 ≤ n ≤ 10^5, 1 ≤ l ≤ 10^9): the number of flags and the length of the road.

The second line contains n integers a_1, a_2, …, a_n in the increasing order (1 ≤ a_1 < a_2 < … < a_n < l).

It is guaranteed that the sum of n among all test cases does not exceed 10^5.

Output

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)}} ≤ 10^{-6}.

Example

Input


5
2 10
1 9
1 10
1
5 7
1 2 3 4 6
2 1000000000
413470354 982876160
9 478
1 10 25 33 239 445 453 468 477


Output


3.000000000000000
3.666666666666667
2.047619047619048
329737645.750000000000000
53.700000000000000

Note

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 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.

In the second test case after 1 second the first car will be in the coordinate 1 and will have the speed equal to 2 meters per second, the second car will be in the coordinate 9 and will have the speed equal to 1 meter per second. So, they will meet after (9-1)/(2+1) = 8/3 seconds. So, the answer is equal to 1 + 8/3 = 11/3.

Solution (in PYTHON3):

Solution:
from sys import stdin, stdout, setrecursionlimit
#import threading

# tail-recursion optimization
# In case of tail-recusion optimized code, have to use python compiler.
# Otherwise, memory limit may exceed.
# declare the class Tail_Recursion_Optimization
class Tail_Recursion_Optimization:
    def __init__(self, RECURSION_LIMIT, STACK_SIZE):
        setrecursionlimit(RECURSION_LIMIT)
        threading.stack_size(STACK_SIZE)
        return None
        
class SOLVE:    
    def solve(self):
        R = stdin.readline
        #f = open('input.txt');R = f.readline
        W = stdout.write
        
        ans = []
        
        for q in range(int(R())):
            n, l = [int(x) for x in R().split()]
            a    = [int(x) for x in R().split()]
            
            left_car  = {}
            right_car = {}
            
            for j in range(n):
                if j == 0:
                    left_car[j] = a[j]
                else:
                    left_car[j] = left_car[j-1] + (a[j]-a[j-1]) / (j+1)
            
            for j in range(n-1, -1, -1):
                if j == n-1:
                    right_car[n-1] = l-a[j]
                else:
                    right_car[j]   = (a[j+1]-a[j]) / (n-j) + right_car[j+1]
            
            flg = 0
            for i in range(n):
                if left_car[i] >= right_car[i]:
                    if i == 0:
                        x = a[i]
                        c = right_car[i]
                    else:
                        x = a[i] - a[i-1]
                        c = right_car[i] - left_car[i-1]

                    x1 = (i+1)/(n+2) * (c*(n-i+1) + x)
                    t1 = (0 if not i else left_car[i-1]) + x1 / (i+1)
                    
                    flg = 1
                    break
                        
            if flg:
                ans.append(str(t1))
                continue

            x = l - a[n-1]
            c = 0 - left_car[n-1]

            x1 = (n+1)/(n+2) * (c + x)
            t1 = left_car[n-1] + x1 / (n+1)

            ans.append(str(t1))
            #print()
        
        W('\n'.join(ans))
        return 0
        
def main():
    s = SOLVE()
    s.solve()
#Tail_Recursion_Optimization(10**7, 100*1024**2) # recursion-call size, stack-size in byte (MB*1024**2)
#threading.Thread(target=main).start()
main()