Problem: Kekoland is a country with n beautiful cities numbered from left to right and connected by n - 1 roads. The i-th road connects cities i and i + 1 and length of this road is wi kilometers. 

When you drive in Kekoland, each time you arrive in city i by car you immediately receive gi liters of gas. There is no other way to get gas in Kekoland.

You were hired by the Kekoland president Keko to organize the most beautiful race Kekoland has ever seen. Let race be between cities l and r (l ≤ r). Race will consist of two stages. On the first stage cars will go from city l to city r. After completing first stage, next day second stage will be held, now racers will go from r to l with their cars. Of course, as it is a race, racers drive directly from start city to finish city. It means that at the first stage they will go only right, and at the second stage they go only left. Beauty of the race between l and r is equal to r - l + 1 since racers will see r - l + 1 beautiful cities of Kekoland. Cars have infinite tank so racers will take all the gas given to them.

At the beginning of each stage racers start the race with empty tank (0 liters of gasoline). They will immediately take their gasoline in start cities (l for the first stage and r for the second stage) right after the race starts. 

It may not be possible to organize a race between l and r if cars will run out of gas before they reach finish.

You have k presents. Each time you give a present to city i its value gi increases by 1. You may distribute presents among cities in any way (also give many presents to one city, each time increasing gi by 1). What is the most beautiful race you can organize?

Each car consumes 1 liter of gas per one kilometer.

Input

The first line of the input contains two integers n and k (2 ≤ n ≤ 100 000, 0 ≤ k ≤ 109) — the number of cities in Kekoland and the number of presents you have, respectively.

Next line contains n - 1 integers. The i-th of them is wi (1 ≤ wi ≤ 109) — the length of the road between city i and i + 1. 

Next line contains n integers. The i-th of them is gi (0 ≤ gi ≤ 109) — the amount of gas you receive every time you enter city i.

Output

Print a single line — the beauty of the most beautiful race you can organize.

Examples

Input

4 4
2 2 2
1 1 1 1


Output

4


Input

8 5
2 2 2 3 7 3 1
1 3 1 5 4 0 2 5


Output

7

Note

In first sample if you give one present to each city then it will be possible to make a race between city 1 and city 4.

In second sample you should add 1 to g5 and 4 to g6, then it will be possible to make a race between cities 2 and 8. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct Tree {
  long long suf;
  long long minp;
  int pos;
  long long addp, adds;
  pair<long long, int> res;
} tree[400005];
struct Edge {
  int to;
  int nxt;
} e[100005];
int n, k, edgenum, nxt[100005], head[100005], maxp[100005], st[100005], top,
    ans;
long long w[100005], g[100005], pre[100005], suf[100005];
void pushdown(int x) {
  if (tree[x].addp) {
    tree[x << 1].addp += tree[x].addp;
    tree[x << 1 | 1].addp += tree[x].addp;
    tree[x << 1].minp += tree[x].addp;
    tree[x << 1 | 1].minp += tree[x].addp;
    tree[x << 1].res.first += tree[x].addp;
    tree[x << 1 | 1].res.first += tree[x].addp;
    tree[x].addp = 0;
  }
  if (tree[x].adds) {
    tree[x << 1].adds += tree[x].adds;
    tree[x << 1 | 1].adds += tree[x].adds;
    tree[x << 1].suf += tree[x].adds;
    tree[x << 1 | 1].suf += tree[x].adds;
    tree[x << 1].minp += tree[x].adds;
    tree[x << 1 | 1].minp += tree[x].adds;
    tree[x].adds = 0;
  }
}
void _debug(int x, int l, int r) {
  printf("%d [%d,%d]:", x, l, r);
  printf("suf=%lld,minp=%lld,pos=%d,res=(%lld,%d)\n", tree[x].suf, tree[x].minp,
         tree[x].pos, tree[x].res.first, tree[x].res.second);
  if (l == r) return;
  pushdown(x);
  _debug(x << 1, l, ((l + r) >> 1));
  _debug(x << 1 | 1, ((l + r) >> 1) + 1, r);
}
pair<long long, int> calc(int x, int l, int r, long long val) {
  if (l == r) return make_pair(tree[x].minp - min(val, tree[x].suf), l);
  pushdown(x);
  pair<long long, int> ansl, ansr;
  if (val < tree[x << 1].minp) {
    ansl = make_pair(tree[x << 1].minp - val, tree[x << 1].pos);
    ansr = calc(x << 1 | 1, ((l + r) >> 1) + 1, r, val);
  } else {
    ansl = calc(x << 1, l, ((l + r) >> 1), val);
    ansr = tree[x].res;
  }
  return min(ansl, ansr);
}
void pushup(int x, int l, int r) {
  tree[x].minp = min(tree[x << 1].minp, tree[x << 1 | 1].minp);
  tree[x].pos = tree[x << 1].minp < tree[x << 1 | 1].minp
                    ? tree[x << 1].pos
                    : tree[x << 1 | 1].pos;
  tree[x].suf = min(tree[x << 1].suf, tree[x << 1 | 1].suf);
  tree[x].res = calc(x << 1 | 1, ((l + r) >> 1) + 1, r, tree[x << 1].suf);
}
void build(int x, int l, int r) {
  if (l == r) {
    tree[x].minp = suf[l];
    tree[x].suf = suf[l];
    tree[x].pos = l;
    return;
  }
  build(x << 1, l, ((l + r) >> 1));
  build(x << 1 | 1, ((l + r) >> 1) + 1, r);
  pushup(x, l, r);
}
void addp(int x, int l, int r, int from, int to, long long v) {
  if (from > to) return;
  if (l >= from && r <= to) {
    tree[x].addp += v;
    tree[x].minp += v;
    tree[x].res.first += v;
    return;
  }
  pushdown(x);
  if (from <= ((l + r) >> 1)) addp(x << 1, l, ((l + r) >> 1), from, to, v);
  if (to > ((l + r) >> 1)) addp(x << 1 | 1, ((l + r) >> 1) + 1, r, from, to, v);
  pushup(x, l, r);
}
void adds(int x, int l, int r, int from, int to, long long v) {
  if (from > to) return;
  if (l >= from && r <= to) {
    tree[x].adds += v;
    tree[x].suf += v;
    tree[x].minp += v;
    return;
  }
  pushdown(x);
  if (from <= ((l + r) >> 1)) adds(x << 1, l, ((l + r) >> 1), from, to, v);
  if (to > ((l + r) >> 1)) adds(x << 1 | 1, ((l + r) >> 1) + 1, r, from, to, v);
  pushup(x, l, r);
}
long long ask(int x, int l, int r, int from, int to) {
  if (l >= from && r <= to) return tree[x].suf;
  long long ans = 1e18;
  pushdown(x);
  if (from <= ((l + r) >> 1))
    ans = min(ans, ask(x << 1, l, ((l + r) >> 1), from, to));
  if (to > ((l + r) >> 1))
    ans = min(ans, ask(x << 1 | 1, ((l + r) >> 1) + 1, r, from, to));
  return ans;
}
int query(int x, int l, int r, int from, int to, long long& val) {
  if (l == r) {
    val = min(val, tree[x].suf);
    return k >= tree[x].minp - val ? l : 0;
  }
  pushdown(x);
  if (l >= from && r <= to) {
    if (k >= calc(x << 1 | 1, ((l + r) >> 1) + 1, r, min(val, tree[x << 1].suf))
                 .first) {
      val = min(val, tree[x << 1].suf);
      return query(x << 1 | 1, ((l + r) >> 1) + 1, r, from, to, val);
    } else if (k >= calc(x << 1, l, ((l + r) >> 1), val).first) {
      int ans = query(x << 1, l, ((l + r) >> 1), from, to, val);
      val = min(val, tree[x << 1 | 1].suf);
      return ans;
    } else
      return 0;
  }
  if (from > ((l + r) >> 1))
    return query(x << 1 | 1, ((l + r) >> 1) + 1, r, from, to, val);
  if (to <= ((l + r) >> 1))
    return query(x << 1, l, ((l + r) >> 1), from, to, val);
  long long left = ask(x << 1, l, ((l + r) >> 1), from, ((l + r) >> 1));
  long long v = min(val, left);
  int ans = query(x << 1 | 1, ((l + r) >> 1) + 1, r, from, to, v);
  if (ans) return ans;
  return query(x << 1, l, ((l + r) >> 1), from, to, val);
}
void add(int u, int v) {
  e[++edgenum].to = v;
  e[edgenum].nxt = head[u];
  head[u] = edgenum;
}
void dfs(int node) {
  st[++top] = node;
  if (nxt[node] && nxt[node] != n + 1) {
    addp(1, 1, n, nxt[node] - 1, n, pre[node] - pre[nxt[node]]);
    adds(1, 1, n, 1, nxt[node] - 2, pre[node] - pre[nxt[node]]);
  }
  maxp[node] = maxp[nxt[node]];
  if (!nxt[node]) maxp[node] = top;
  while (pre[node] - pre[st[maxp[node]]] > k) maxp[node]++;
  if (node <= n) {
    addp(1, 1, n, st[maxp[node] - 1] - 1, st[maxp[node] - 1] - 1,
         pre[st[maxp[node] - 1]] - pre[st[maxp[node]]]);
    adds(1, 1, n, st[maxp[node] - 1] - 1, st[maxp[node] - 1] - 1,
         pre[st[maxp[node]]] - pre[st[maxp[node] - 1]]);
  }
  long long tmp = 1e18;
  if (nxt[node])
    ans =
        max(ans, query(1, 1, n, node, st[maxp[node] - 1] - 1, tmp) - node + 1);
  if (node <= n) {
    addp(1, 1, n, st[maxp[node] - 1] - 1, st[maxp[node] - 1] - 1,
         pre[st[maxp[node]]] - pre[st[maxp[node] - 1]]);
    adds(1, 1, n, st[maxp[node] - 1] - 1, st[maxp[node] - 1] - 1,
         pre[st[maxp[node] - 1]] - pre[st[maxp[node]]]);
  }
  for (int hd = head[node]; hd; hd = e[hd].nxt) {
    int to = e[hd].to;
    dfs(to);
  }
  top--;
  if (nxt[node] && nxt[node] != n + 1) {
    addp(1, 1, n, nxt[node] - 1, n, pre[nxt[node]] - pre[node]);
    adds(1, 1, n, 1, nxt[node] - 2, pre[nxt[node]] - pre[node]);
  }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i < n; i++) scanf("%lld", &w[i]);
  for (int i = 1; i <= n; i++) scanf("%lld", &g[i]);
  for (int i = 2; i <= n; i++) pre[i] = pre[i - 1] + g[i - 1] - w[i - 1];
  for (int i = n - 1; i >= 1; i--) suf[i] = suf[i + 1] + g[i + 1] - w[i];
  pre[n + 1] = -1e18;
  build(1, 1, n);
  for (int i = n + 1; i >= 1; i--) {
    while (top && pre[st[top]] >= pre[i]) top--;
    nxt[i] = st[top];
    if (top) add(st[top], i);
    st[++top] = i;
  }
  top = 0;
  dfs(n + 1);
  printf("%d\n", ans);
  return 0;
}