403864: GYM101343 F Certifications

Dr. Samer have made an agreement with GX company to design certificates for each lecture in Innovation Programming Lab.

GX company gave Dr. Samer n offers, where the i^th offer contains a_i certificates. If Dr. Samer wants to take the i^th offer, he must buy all the certificates given by this offer.

Dr. Samer wants to buy x certificates for each lecture and he wants to get the offer because it will reduce the cost to more than 50% for some offers. For each lecture, Dr. Samer will buy the minimum number of certification such that he will be able to give each student a certification. with the guarantee that he will spend the minimal amount of money.

Can you help Dr. Samer to know what is the number of certificates he need to buy for each lecture to get any acceptable offer?

The first line contains an integer n (1  ≤  n  ≤  10⁵), where n is the number of offers given by GX company.

The second line contains n integers a₁, a₂, ... a_n (1  ≤  a_i  ≤  10⁹), where a_i is the number of certificates in the i^th offer.

The third line contains an integer m (1  ≤  m  ≤  10⁵), where m is the number of lectures in Innovation Programming Lab.

The fourth line contains m integers x₁, x₂, ... x_m (1  ≤  x_i  ≤  10⁹), where x_i is the number of certificates needed for the i^th lecture.

Print m lines. The i^th line must contain an integer x, where x is the number of certificates that Dr.Samer will buy for the i^th lecture.

If Dr. Samer cannot take any offer for the i^th lecture, print "Dr. Samer cannot take any offer :(." (without quotes).

5
2 4 6 8 10
4
2 3 7 1

2
4
8
2

3
100 5 50
5
15 2 10 200 5

50
5
50
Dr. Samer cannot take any offer :(.
5