#include <iostream>
#include <algorithm>
#include <vector>

using lint = long long;

void solve() {
    int n, s, t;
    std::cin >> n >> s >> t;
    --s, --t;

    auto dist = [&](int i, int j) {
        int d = std::abs(i - j);
        return std::min(d, n - d);
    };

    lint ans = 0;

    std::vector<lint> same;
    for (int i = 0; i < n; ++i) {
        lint x;
        std::cin >> x;

        int ds = dist(s, i),
            dt = dist(t, i);

        if (ds < dt) {
            ans += x;
        } else if (ds > dt) {
            ans -= x;
        } else {
            same.push_back(x);
        }
    }

    std::sort(same.rbegin(), same.rend());
    {
        int sign = 1;
        for (auto x : same) {
            ans += x * sign;
            sign = -sign;
        }
    }

    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}