Max power of sage

Sage has two weapons p and q. She has an array A of attacks. She wants to choose two indices i and j (1<=i<=j and j<=n) such that her power p*A[i]+q*A[j] is maximum. ###Input:- First line contains three integers n,p and q(1<=n<=10^5 and -10^9<=p,q<=10^9). Second line contains n integers i.e the array of attacks (-10^9<=A[i]<=10^9). ###Output:- Maximum possible value for p*A[i]+q*