#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}

template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << '{';
  for (const T &item : v) out << item << ", ";
  out << "\b\b}";
  return out;
}
#endif

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 500010

int C[SIZE];
ll D[SIZE];

int main(){
  int N, P, Q;

  ll sum = 0;

  scanf("%d%d%d", &N, &P, &Q);

  for (int i=0; i<N; i++) {
    scanf("%d", C+i);
    sum += C[i];
    D[i] = (ll)P * i + C[i];
    debug(D[i]);
  }

  sort(D, D+N);

  ll ans = sum;

  for (int i=0; i<N; i++) {
    ll E = (ll)P * (Q + 2 * i);
    sum += E - D[i];
    ans = max(ans, sum);
  }

  printf("%lld\n", ans);

  return 0;
}

