#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair< int,int >
#define QWQ return 0;
#define QAQ return 

const int N=20;

set< int > a, b, c;
stack< pii > rep;
vector< pii > ans;

inline void ope( int x,int y )
{
    if( a.find( y ) != a.end() )
    { rep.push( { x,y } ); QAQ; }
    a.erase( x ); a.insert( y );
    ans.push_back( { x,y } );
}

inline int lowbit( int x ){ QAQ x&-x; }

inline void turn( int x,int y )
{
    while( x != y )
    {
        int diff=x^y; diff=lowbit( diff );
        ope( x,x^diff );
        x^=diff;
    }
    while( !rep.empty() )
    {
        auto [nx,ny]=rep.top();
        rep.pop();
        turn( nx,ny );
    }
}

int main()
{
    // freopen( "1.in","r",stdin );
    // freopen( "1.out","w",stdout );
    ios::sync_with_stdio( false );
    cin.tie( nullptr ); cout.tie( nullptr );
    int n;
    cin>>n;
    for( int i=1, x;i<=n;i++ )
        cin>>x,
        a.insert( x ), c.insert( x );
    for( int i=1, x;i<=n;i++ )
        cin>>x,
        b.insert( x );
    while( !b.empty() )
    {
        int y=*b.begin();
        if( a.find( y ) != a.end() )
        { b.erase( y ); c.erase( y );
          continue; }
        int x=*c.begin();
        turn( x,y );
        b.erase( y ); c.erase( x );
    }
    cout<<ans.size()<<"\n";
    for( auto &[x,y]:ans ) cout<<x<<" "<<y<<"\n";
    QWQ
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair< int,int >
#define QWQ return 0;
#define QAQ return 

const int N=5e3+10, mod=1e9+7;

int fib[N];
int g[N], sum[N];
int f[N][2], num[N][2];

int main()
{
    // freopen( "1.in","r",stdin );
    // freopen( "1.out","w",stdout );
    ios::sync_with_stdio( false );
    cin.tie( nullptr ); cout.tie( nullptr );
    int n;
    cin>>n;
    fib[1]=1; fib[2]=1;
    for( int i=3;i<=n;i++ ) fib[i]=( fib[i-1]+fib[i-2] )%mod;
    num[0][0]=1;
    for( int i=1;i<=n;i++ )
    {
        f[i][0]=( f[i-1][0]+f[i-1][1] )%mod;
        f[i][1]=( f[i-1][0]+1ll*fib[i+1]*num[i-1][0] )%mod;
        num[i][0]=( num[i-1][0]+num[i-1][1] )%mod;
		num[i][1]=num[i-1][0];
    }
    sum[0]=1;
    for( int i=1;i<=n;i++ ) for( int j=1;j<i;j++ )
    {
        ( g[i]+=( 1ll*f[j][1]*sum[i-j-1]%mod+1ll*g[i-j-1]*num[j][1]%mod )%mod )%=mod;
        ( sum[i]+=1ll*sum[i-j-1]*num[j][1]%mod )%=mod; 
    }
    for( int i=1;i<=n;i++ )
	{
		int ans=0;
		for( int j=2;j<=i;j++ ) ( ans+=1ll*g[j]*( num[i-j][0]+num[i-j][1] )%mod )%=mod;
		cout<<ans<<" ";
	}
    QWQ
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair< int,int >
#define QWQ return 0;
#define QAQ return 
#define intt __int128_t

const int N=1e5+10, m=1e5;

int pre[N], bck[N], all[N]; 
intt ans[N];

inline void print( intt x )
{
	if( x > 9 ) print( x/10 );
	putchar( x%10+'0' );
}

int main()
{
    // freopen( "1.in","r",stdin );
    // freopen( "1.out","w",stdout );
    ios::sync_with_stdio( false );
    cin.tie( nullptr ); cout.tie( nullptr );
    int n, t, s, k;
    cin>>n>>t>>s>>k;
    for( int i=1, h;i<=n;i++ )
        cin>>h,
        pre[h]++, bck[h]++;
    for( int i=1;i<=m;i++ )   pre[i]+=pre[i-1];
    for( int i=m-1;i>=0;i-- ) bck[i]+=bck[i+1];
    for( int i=m-1;i>=0;i-- )
    {
        intt fee1=( intt )bck[i+1+all[i+1]]*t;
        intt fee2=( intt )s+( intt )k*pre[all[i+1]];
        if( fee1 <= fee2 ) ans[i]=ans[i+1]+fee1, all[i]=all[i+1];
        else               ans[i]=ans[i+1]+fee2, all[i]=all[i+1]+1;
    }
    int q, x;
    for( cin>>q;q;q-- ) cin>>x, print( ans[x] ), putchar( ' ' );
    QWQ
}