CodeForces 474B 二分

http://codeforces.com/problemset/problem/474/B

It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.

Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers 1 to a1, worms in second pile are labeled with numbers a1 + 1 to a1 + a2 and so on. See the example for a better understanding.

Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.

Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.

Input

The first line contains a single integer n (1 ≤ n ≤ 10^5), the number of piles.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 103, a1 + a2 + ... + an ≤ 10^6), where ai is the number of worms in the i-th pile.

The third line contains single integer m (1 ≤ m ≤ 10^5), the number of juicy worms said by Marmot.

The fourth line contains m integers q1, q2, ..., qm (1 ≤ qi ≤ a1 + a2 + ... + an), the labels of the juicy worms.

Output

Print m lines to the standard output. The i-th line should contain an integer, representing the number of the pile where the worm labeled with the number qi is.

Examples

Input

5
2 7 3 4 9
3
1 25 11

Output

1
5
3

Note

For the sample input:

• The worms with labels from [1, 2] are in the first pile.
• The worms with labels from [3, 9] are in the second pile.
• The worms with labels from [10, 12] are in the third pile.
• The worms with labels from [13, 16] are in the fourth pile.
• The worms with labels from [17, 25] are in the fifth pile.

题目大意：有n堆虫子，每堆虫子有ai只，第一堆虫子的编号为1-a1，第二堆虫子的编号为1+a1到a1+a2……，然后告诉你m个最美味的虫子的编号，让你顺序输出这m个虫子所在堆的编号。

思路：看到这个编号的规则，应该很快能想到前缀和数组。该数组必定升序，因此可用二分搜索。暴力O(mn)应该会炸吧。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<set>
#include<algorithm>
#include<iterator>
#define EPS 1e-12
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;

int sum[100005];

int main()
{
	int n;
	int temp;
	scanf("%d",&n);
	scanf("%d",&temp);
	sum[0]=temp;
	for(int i=1;i<n;++i)
	{
		scanf("%d",&temp);
		sum[i]=sum[i-1]+temp;
	}
	int m;
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d",&temp);
		int t=lower_bound(sum,sum+n,temp)-sum;
		printf("%d\n",t+1);
	}
	return 0;
}