import heapq
import sys


def input(): return sys.stdin.readline().rstrip()


def main():
    N = int(input())
    *L, = map(int, input().split())
    int(input())  # Q
    *K, = map(int, input().split())

    ans = [float('inf')]

    Q = [(-L[i], i, 1) for i in range(N)]
    heapq.heapify(Q)

    for i in range(max(K)):
        c, iv, kv = Q[0]
        ans.append(-c)
        heapq.heappushpop(Q, (-L[iv]/(kv+1), iv, kv+1))

    print(*[ans[k] for k in K], sep='\n')


if __name__ == '__main__':
    main()