import bisect

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    n = int(data[idx])
    idx += 1
    L = list(map(int, data[idx:idx + n]))
    idx += n
    L.sort()
    max_L = L[-1] if n > 0 else 0
    Q = int(data[idx])
    idx += 1
    K_list = list(map(int, data[idx:idx + Q]))
    
    for K in K_list:
        low = 0.0
        high = max_L
        for _ in range(100):
            mid = (low + high) / 2
            if mid == 0:
                sum_val = float('inf')
            else:
                sum_val = 0
                m = 1
                prev_pos = 0
                while True:
                    target = m * mid
                    if target > max_L:
                        break
                    pos = bisect.bisect_left(L, target, prev_pos)
                    count = n - pos
                    if count <= 0:
                        break
                    sum_val += count
                    if sum_val >= K:
                        break
                    prev_pos = pos
                    m += 1
            if sum_val >= K:
                low = mid
            else:
                high = mid
        print("{0:.15f}".format(low))
        
if __name__ == "__main__":
    main()