#include using namespace std; typedef long long ll; typedef pair P; long long int INF = 3e18; double Pi = 3.1415926535897932384626; //vector G[550010]; //vector

tree[500010]; priority_queue pql; priority_queue

pqp; //big priority queue priority_queue ,greater > pqls; priority_queue ,greater

> pqps; //small priority queue //top pop int dx[8]={1,0,-1,0,1,1,-1,-1}; int dy[8]={0,1,0,-1,1,-1,-1,1}; char dir[] = "DRUL"; //ll bit[500005]; //↓,→,↑,← #define p(x) cout< number2){ swap(number1,number2); } if(number1 == 0 || number1 == number2){ return number2; }else{ return gcd(number2 % number1,number1); } } void YES(bool condition){ if(condition){ p("YES"); }else{ p("NO"); } return; } void Yes(bool condition){ if(condition){ p("Yes"); }else{ p("No"); } return; } /* ll fact[800005],rfact[800005]; void c3_init(){ fact[0] = rfact[0] = 1; for(ll i=1; i<=800000; i++){ fact[i] = (fact[i-1]*i) % mod; } rfact[800000] = rui(fact[800000],mod - 2); for(ll i=800000; i>=1; i--){ rfact[i-1] = rfact[i] * i; rfact[i-1] %= mod; } return;} ll c3(ll n,ll r){ return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;} */ ll n,m,num,sum,a,b,c,d,e,g,h,w,i,j,q,r,l; ll k,ans; ll x[500005],y[500005],z[500005]; char s[500005]; bool dp[500005]; ll ban[59][59]; int main(){ cin >> n >> k; for(int i=0;i> x[i]; } for(i=0;i> y[i]; } ll lidx, ridx; lidx = k - 1; ridx = k - 1; l = x[k - 1] - y[k - 1]; r = x[k - 1] + y[k - 1]; while(1){ pe(l);p(r); bool flag = false; if(lidx > 0 && x[lidx - 1] >= l){ lidx--; l = min(l, x[lidx] - y[lidx]); r = max(r, x[lidx] + y[lidx]); flag = true; } if(ridx < n - 1 && x[ridx + 1] <= r){ ridx++; l = min(l, x[ridx] - y[ridx]); r = max(r, x[ridx] + y[ridx]); flag = true; } if(!flag)break; } p(ridx - lidx + 1); return 0; }