#include<iostream>
#include<cstdio>
#include<ctime>
#include<cstdlib>
#include<random>
#define N 60000
using namespace std;
mt19937 RAND(time(0));
int read()
{
    char c=0;
    int sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
int ST,n,p[N+1],leng,a,b,rt;
long long tong[N+1];
struct fhq_treap
{
    struct node
    {
	int ls,rs,sz,rd;
	long long data,lazy1,lazy2;
    };
    node tree[N+1];
    int length;
    int new_node(long long x)
    {
	tree[++length]=(node){0,0,1,RAND()%1000000000,x,0,0};
	return length;
    }
    void push_up(int k)
    {
	tree[k].sz=tree[tree[k].ls].sz+tree[tree[k].rs].sz+1;
	return;
    }
    void get_spread1(int k,long long d)
    {
	if (!k) return;
	tree[k].data+=d,tree[k].lazy1+=d;
	return;
    }
    void get_spread2(int k,long long d)
    {
	if (!k) return;
	tree[k].data+=d*tree[tree[k].ls].sz,tree[k].lazy2+=d;
	return;
    }
    void spread(int k)
    {
	if (tree[k].lazy1) get_spread1(tree[k].ls,tree[k].lazy1),get_spread1(tree[k].rs,tree[k].lazy1),tree[k].lazy1=0;
	if (tree[k].lazy2) get_spread2(tree[k].ls,tree[k].lazy2),get_spread1(tree[k].rs,tree[k].lazy2*(tree[tree[k].ls].sz+1)),get_spread2(tree[k].rs,tree[k].lazy2),tree[k].lazy2=0;
	return;
    }
    int merge(int x,int y)
    {
	if (!x||!y) return x^y;
	if (tree[x].rd<tree[y].rd)
	{
	    spread(y),tree[y].ls=merge(x,tree[y].ls),push_up(y);
	    return y;
	}
	else
	{
	    spread(x),tree[x].rs=merge(tree[x].rs,y),push_up(x);
	    return x;
	}
    }
    void split(int k,int d,int &x,int &y)
    {
	if (!k)
	{
	    x=y=0;
	    return;
	}
	spread(k);
	if (d<=tree[tree[k].ls].sz) split(tree[k].ls,d,x,tree[k].ls),y=k;
	else split(tree[k].rs,d-tree[tree[k].ls].sz-1,tree[k].rs,y),x=k;
	push_up(k);
	return;
    }
    void solve(int k)
    {
	spread(k);
	if (tree[k].ls) solve(tree[k].ls); 
	++leng,tong[leng]=tong[leng-1]+tree[k].data;
	if (tree[k].rs) solve(tree[k].rs);
	return;
    }
    int find(int k,int d,int cnt)
    {
	if (!k) return 0;
	int scnt=cnt+tree[tree[k].ls].sz;
	spread(k);
	if (!scnt||1ll*d*scnt*scnt+1ll*d*a*scnt+1ll*d*b<tree[k].data) return max(scnt,find(tree[k].rs,d,scnt+1));
	else return find(tree[k].ls,d,cnt);
    }
};
fhq_treap T;
int main()
{
    int ps,A,B,C;
    ST=read();
    while (ST--)
    {
	n=read(),T.length=0;
	for (int i=1;i<=n;++i) p[i]=read();
	a=read(),b=read(),rt=T.new_node(0);
	for (int i=1;i<=n;++i)
	{
	    ps=T.find(rt,p[i],0),T.split(rt,ps+1,A,C),B=T.new_node(1ll*p[i]*(ps+1)*(ps+1)+1ll*p[i]*a*(ps+1)+1ll*p[i]*b);
	    if (C) T.get_spread1(C,1ll*p[i]*(a+(ps<<1)+3)),T.get_spread2(C,p[i]*2);
	    rt=T.merge(T.merge(A,B),C);
	}
	leng=0,T.solve(rt);
	for (int i=2;i<=leng;++i) printf("%lld ",tong[i]);
	puts("");
    }
    return 0;
}