#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;

template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}

constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;

int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

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

    int n, k; cin>>n>>k;
    k--;
    vector<ll> a(n);
    for(int i=0; i<n; i++) cin>>a[i];

    if(a[k] == 0){
        cout << 0 << endl;
        return 0;
    }
    
    ll rsum = 0, lsum = 0;
    for(int i=k+1; i<n; i++){
        if(a[i] == 0) break;
        rsum += a[i];
        if(a[i] == 1) break;
    }

    for(int i=k-1; i>=0; i--){
        if(a[i] == 0) break;
        lsum += a[i];
        if(a[i] == 1) break;
    }

    if(a[k] == 1){
        cout << max(lsum, rsum) + a[k] << endl;
    }
    else{
        cout << lsum + rsum + a[k] << endl;
    }

    return 0;
}