Problem: Monocarp would like to open a bakery in his local area. But, at first, he should figure out whether he can compete with other shops.

Monocarp plans that the bakery will work for n days. On the i-th day, a_i loaves of bread will be baked in the morning before the opening. At the end of the n-th day, Monocarp will sell all the remaining bread that wasn't sold earlier with a huge discount.

Because of how bread is stored, the bakery seller sells the bread in the following order: firstly, he sells the loaves that were baked that morning; secondly, he sells the loaves that were baked the day before and weren't sold yet; then the loaves that were baked two days before and weren't sold yet, and so on. That's why some customers may buy a rather stale bread and will definitely spread negative rumors.

Let's define loaf spoilage as the difference between the day it was baked and the day it was sold. Then the unattractiveness of the bakery will be equal to the maximum spoilage among all loaves of bread baked at the bakery.

Suppose Monocarp's local area has consumer demand equal to k, it means that each day k customers will come to the bakery and each of them will ask for one loaf of bread (the loaves are sold according to the aforementioned order). If there is no bread left, then the person just doesn't buy anything. During the last day sale, all the remaining loaves will be sold (and they will still count in the calculation of the unattractiveness).

Monocarp analyzed his competitors' data and came up with m possible consumer demand values k_1, k_2, ..., k_m, and now he'd like to calculate the unattractiveness of the bakery for each value of demand. Can you help him?

Input

The first line contains two integers n and m (1 ≤ n ≤ 2 ⋅ 10^5; 1 ≤ m ≤ 2 ⋅ 10^5) — the number of days the bakery is open and the number of possible values of consumer demand.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — the number of bread loaves that will be baked each day.

The third line contains m integers k_1, k_2, ..., k_m (1 ≤ k_1 < k_2 < ... < k_m ≤ 10^9) — the possible consumer demand values in the ascending order.

Output

Print m integers: for each consumer demand, print the unattractiveness of the bakery.

Examples

Input


5 4
5 2 1 3 7
1 3 4 10


Output


4 2 1 0 


Input


8 9
3 1 4 1 5 9 2 6
1 2 3 4 5 6 7 8 9


Output


7 5 3 3 2 1 1 1 0 

Note

In the first example, let's describe what happens for couple consumer demands:

If consumer demand is equal to 1: 

  * at day 1: 5 loaves are baked and only 1 is sold with spoilage equal to 1 - 1 = 0; 
  * at day 2: 4 loaves are left and 2 more are baked. Only 1 loaf was sold and it was the loaf baked today with spoilage 2 - 2 = 0; 
  * at day 3: 4 loaves from the first day and 1 loaf from the second day left. One more loaf was baked and was sold this day with spoilage 3 - 3 = 0; 
  * at day 4: 4 loaves from the first day and 1 loaf from the second day left. 3 more loaves were baked and one of them was sold this day with spoilage 4 - 4 = 0; 
  * at day 5: 4 loaves from the first day, 1 loaf from the second day and 2 loaves from the fourth day left. 7 more loaves were baked and, since it's the last day, all 14 loaves were sold. 4 loaves from the first day have the maximum spoilage equal to 5 - 1 = 4. 

In total, the unattractiveness of the bakery will be equal to 4.

If consumer demand is equal to 10 then all baked bread will be sold in the day it was baked and will have spoilage equal to 0.

Solution (in CPP):

Solution:
// {{{ Template

/*CYJian yyds!*/
/*ldx gg txdy!*/
/*sto karry,tiger,lsqs orz*/

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

typedef double db;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;

typedef vector <int> poly;
typedef pair <int,int> pii;

#define fi first
#define se second
#define rez resize
#define pp pop_back
#define pb push_back
#define mkp make_pair

#define lep(i,l,r) for(int i=l;i<=r;++i)
#define rep(i,r,l) for(int i=r;i>=l;--i)

#define CLEAR(x) memset((x),0,sizeof((x)))
#define COPY(x,y) memcpy((x),(y),sizeof((x)))

const int inf=1e9+7;
const int mod=1e9+7;

template <class T> inline T read() {
	char ch; bool flag=0; T x=0;
	while(ch=getchar(),!isdigit(ch)) if(ch=='-') flag=1;
	while(isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return flag?-x:x;
}
struct {
	inline operator ll() {return read<ll>();}
	inline operator int() {return read<int>();}
	inline operator bool() {return read<bool>();}
	inline operator double() {double _tmp; return scanf("%lf",&_tmp),_tmp;}
	template <class T> inline void operator () (T &x) {x=*this;}
	template <class T,class ...A> inline void operator () (T &x,A &...a)
	{x=*this,this->operator()(a...);}
} IN;

template <class T> inline void chkmax(T &x,T y) {if(x<y) x=y;}
template <class T> inline void chkmin(T &x,T y) {if(x>y) x=y;}

inline int mul(int x,int y) {return 1ll*x*y%mod;}
inline int dec(int x,int y) {x-=y; if(x<0) x+=mod; return x;}
inline int add(int x,int y) {x+=y; if(x>=mod) x-=mod; return x;}
inline void sub(int &x,int y) {x-=y; if(x<0) x+=mod;}
inline void pls(int &x,int y) {x+=y; if(x>=mod) x-=mod;}
inline int modpow(int x,int y,int res=1) {
	if(y==-1) y=mod-2;
	for(;y;y>>=1,x=mul(x,x)) if(y&1) res=mul(res,x);
	return res;
}

// }}}

const int N=2e5+5;

ll a[N],sum[N];
int n,m,q[N],L[N],R[N];
struct Node {
	int l,r; ll val;
	bool operator < (const Node &ele) const {return val>ele.val||(val==ele.val&&r>ele.r);}
}; std::set <Node> S;

inline ll calc(int l,int r) {return (sum[r]-sum[l-1]+r-l)/(r-l+1); }
inline Node merge(Node a,Node b) {
	R[a.l]=b.r,L[b.r]=a.l;
	return (Node){a.l,b.r,calc(a.l,b.r)};
}

int ans[N],qwq[N],tim[N];
int main() {
	IN(n,m);
	lep(i,1,n) IN(a[i]); a[n]=-2e18;
	lep(i,1,n) L[i]=R[i]=i,S.insert((Node){i,i,a[i]});
	lep(i,1,n) sum[i]=sum[i-1]+a[i];

	int c=0; tim[0]=inf;
	while(S.size()>1) {
		Node now=*S.begin(),nxt=(Node){now.r+1,R[now.r+1],calc(now.r+1,R[now.r+1])};
		S.erase(now),S.erase(nxt),S.insert(merge(now,nxt));

		if(now.val<tim[c]) ++c,qwq[c]=max(qwq[c-1],nxt.r-now.l),tim[c]=now.val;
		else chkmax(qwq[c],nxt.r-now.l);
	}
	lep(i,1,c) --tim[i];
	std::reverse(tim+1,tim+1+c),std::reverse(qwq+1,qwq+1+c);
	lep(i,1,m) IN(q[i]),printf("%d ",qwq[lower_bound(tim+1,tim+1+c,q[i])-tim]);
	return puts(""),0;
}