#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
ll pow(ll a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }




int main() {
    int cnt[100007] = {0};
    int n, k;
    int lflg = 0, rflg = 0;

    cin >> n >> k;
    vector<ll> x(n), a(n);
    k--;
    rep(i, n) cin >> x[i];
    rep(i, n) cin >> a[i];
    
    ll l = x[k] - a[k], r = x[k] + a[k];
    // cout << l << " " << r << endl;
    
    cnt[k] = 1;
    
    int c = 0;
    while (c++ < n) {
        int it = (int)(upper_bound(all(x), r) - x.begin());
        it--;
        
        if (cnt[it] == 1) {
            rflg = 1;
        } else {
            cnt[it] = 1;
            l = min(l, x[it] - a[it]);
            r = max(r, x[it] + a[it]);
        }
        
        it = (int)(lower_bound(all(x), l) - x.begin());
        
        if (cnt[it] == 1) {
            lflg = 1;
        } else {
            cnt[it] = 1;
            l = min(l, x[it] - a[it]);
            r = max(r, x[it] + a[it]);
        }
        
        // cout << l << " " << r << endl;
        if (lflg && rflg) break;
    }
    
    
    
    rep3(i, 1, n) cnt[i] += cnt[i - 1];
    cout << cnt[n - 1] << endl;
}