18074번 - High Load Database 다국어

Henry profiles a high load database migration script. The script is the list of n transactions. The i-th transaction consists of ai queries. Henry wants to split the script to the minimum possible number of batches, where each batch contains either one transaction or a sequence of consecutive transactions, and the total number of queries in each batch does not exceed t.

Unfortunately, Henry does not know the exact value of t for the production database, so he is going to estimate the minimum number of batches for q possible values of t: t₁, t₂, . . . , t_q. Help Henry to calculate the number of transactions for each of them.

The first line contains a single integer n — the number of transactions in the migration script (1 ≤ n ≤ 200 000).

The second line consists of n integers a₁, a₂, . . . , a_n — the number of queries in each transaction (1 ≤ a_i; ∑a_i ≤ 10⁶).

The third line contains an integer q — the number of queries (1 ≤ q ≤ 100 000). The fourth line contains q integers t₁, t₂, . . . , t_q (1 ≤ t_i ≤ ∑a_i).

Output q lines. The i-th line should contain the minimum possible number of batches, having at most ti queries each. If it is not possible to split the script into the batches for some ti , output “Impossible” instead.

Remember that you may not rearrange transactions, only group consecutive transactions in a batch.