#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
ll N, P, Q;
ll C[500000];
ll inv[500000];
vector<l_l> v;
ll now = 0;
ll ans = -1e18;

void chmax(ll &a, ll b) {
    a = max(a, b);
}
struct SegmentTree {
private:
    int n;
    vector<int> node;
 
public:
    SegmentTree() {
        int sz = 500010;
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, 0);
        for(int i=0; i<sz; i++) node[i+n-1] = 0;
        for(int i=n-2; i>=0; i--) node[i] = min(node[2*i+1], node[2*i+2]);
    }
 
    void update(int x, int val) {
        x += (n - 1);
        node[x] = val;
        while(x > 0) {
            x = (x - 1) / 2;
            node[x] = (node[2*x+1] + node[2*x+2]);
        }
    }
    // hannkaikukann 
    int getsum(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        if(r <= a || b <= l) return 0;
        if(a <= l && r <= b) return node[k];
 
        int vl = getsum(a, b, 2*k+1, l, (l+r)/2);
        int vr = getsum(a, b, 2*k+2, (l+r)/2, r);
        return (vl + vr);
    }
};


int main() {
    //cout.precision(10);
    cin >> N >> P >> Q;
    for(ll i = 0; i < N; i++) {
        cin >> C[i];
        v.push_back({P * i + C[i], i});
        now += C[i];
    }
    ans = now;
    sort(v.begin(), v.end());
    SegmentTree seg;
    for(auto tmp : v) {
        int idx = tmp.second;
        now -= C[idx];
        ll num = seg.getsum(0, idx);
        num = num - (idx - num);
        //cerr << num;
        now += (Q + num) * P;
        now += (2 * seg.getsum(idx, N)) * P;
        chmax(ans, now);
        seg.update(idx, 1);
    }
    cout << ans << endl;
    return 0;
}
