module main;

import std;

long N, Q;
real[] L;
long[] K;
// 長さMでk個の板がとれるかどうか
bool solve(real M, long k)
{
	auto cnt = L.map!(a => floor(a / M)).sum;
	return cnt >= k;
}

void main()
{
	// 入力
	N = readln.chomp.to!long;
	L = readln.split.to!(real[]);
	Q = readln.chomp.to!long;
	K = readln.split.to!(long[]);
	// 答えの計算と出力(二分探索法)
	foreach (k; K) {
		real l = 0.0, r = 1e9;
		while (!isClose(l, r, 0.0, 1e-10)) {
			real m = (l + r) / 2;
			if (solve(m, k))
				l = m;
			else
				r = m;
		}
		writefln("%.12f", r);
	}
}