import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const S = readInt() - 1;
      const T = readInt() - 1;
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      auto ASum = new long[N + 1];
      foreach (i; 0 .. N) {
        ASum[i + 1] = ASum[i] + A[i];
      }
      
      long getSum(int s, int t) {
        long ret;
        foreach (shift; -2 .. +2 + 1) {
          const lb = max(s - shift * N, 0);
          const ub = min(t - shift * N, N);
          if (lb < ub) {
            ret += ASum[ub] - ASum[lb];
          }
        }
        return ret;
      }
      
      const int d0 = ((T - S) % N + N) % N - 1;
      const int d1 = N - 2 - d0;
      debug {
        writeln(d0, " ", d1);
      }
      long ans = long.min;
      foreach (x0; 0 .. (N - 2 + 1) / 2 + 1) {
        const x1 = (N - 2 + 1) / 2 - x0;
        if (0 <= x0 && x0 <= (d0 + 1) / 2 && 0 <= x1 && x1 <= (d1 + 1) / 2) {
          debug {
            writeln("  ", x0, " ", x1);
          }
          const res = getSum(S - x1, S + x0 + 1);
          chmax(ans, res - (ASum[N] - res));
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}