#include<bits/stdc++.h>
using namespace std;

int main() {
  int n, k;
  cin >> n >> k;
  k--;
  vector<int> a(n);
  for(int i = 0; i < n; i++) cin >> a[i];
  if(a[k] == 0) {
    cout << 0 << endl;
    return 0;
  }
  long long ans1 = 0, ans2 = 0;
  int pos = k;
  while(pos && a[pos - 1]) {
    pos--;
    ans1 += a[pos];
    if(a[pos] == 1) break;
  }
  pos = k;
  while(pos < n - 1 && a[pos + 1]) {
    pos++;
    ans2 += a[pos];
    if(a[pos] == 1) break;
  }
  if(a[k] == 1) cout << max(ans1, ans2) + a[k] << endl;
  else cout << ans1 + ans2 + a[k] << endl;
}