#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
typedef long long ll;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1LL;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;
 
#define MOD 1000000007

ll n,k;
vector<ll> vx,va;

ll l1,r1;
ll l2,r2;
ll d[100100];

ll ans;

void f(ll p){
	if(d[p]==0&&l1<=vx[p]&&vx[p]<=r1){
		ans++;
		d[p]=1;
		l1 = min(l1,vx[p]-va[p]);
		r1 = max(r1,vx[p]+va[p]);
		l2 = min(l2,p);
		r2 = max(r2,p);
		if(r2<n-1)f(r2+1);
		if(0<l2)f(l2-1);
	}
}

int main() {
	clr(d,0);
	ans = 0;
	cin>>n>>k;
	k--;
	rep(i,0,n){
		ll a;
		cin>>a;
		vx.pb(a);
	}
	rep(i,0,n){
		ll a;
		cin>>a;
		va.pb(a);
	}
	l1 = vx[k];
	r1 = vx[k];
	l2 = k;
	r2 = k;
	f(k);
	cout << ans << endl;
	return 0;
}