macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    input! {
        n: usize,
        s: usize,
        t: usize,
        a: [i64; n],
    }
    let mut a2 = vec![];
    for x in &a {
        a2.push(x);
    }
    for x in &a {
        a2.push(x);
    }
    let mut b = vec![0; a2.len() + 1];
    for i in 0..a2.len() {
        b[i + 1] = b[i] + a2[i];
    }
    // dbg!(b);
    if s < t {
        let mut my = std::i64::MAX;
        for i in s..t {
            if n / 2 + i >= t && n / 2 + i < s + n {
                let y = b[n / 2 + i] - b[i];
                // dbg!(i, y);
                my = std::cmp::min(my, y);
            }
        }
        println!("{}", a.iter().sum::<i64>() - my * 2);
    } else {
        let mut my = std::i64::MAX;
        for i in s..t + n {
            if n / 2 + i >= t + n && n / 2 + i < s + n {
                let y = b[n / 2 + i] - b[i];
                // dbg!(i, y);
                my = std::cmp::min(my, y);
            }
        }
        println!("{}", a.iter().sum::<i64>() - my * 2);
    }
}