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;
const int MaxN = 100010, MaxT = 1 << 19;
const long long inf = 1ll << 60;
struct node {
  long long mxsuf, mnp, mnr, lazy;
} T[MaxT];
class Graph {
 public:
  int en[MaxN], next[MaxN], to[MaxN], tot;
  long long value[MaxN];
  void add_edge(int x, int y, long long z) {
    next[++tot] = en[x];
    en[x] = tot;
    to[tot] = y;
    value[tot] = z;
  }
} G;
int w[MaxN], g[MaxN], n, k, ans, node[MaxN];
long long suf[MaxN], pre[MaxN];
void add_lazy(int now, long long lazy) {
  T[now].mxsuf += lazy;
  T[now].mnr += lazy;
  T[now].lazy += lazy;
}
void push_down(int now) {
  if (T[now].lazy) {
    add_lazy(now << 1, T[now].lazy);
    add_lazy(now << 1 | 1, T[now].lazy);
    T[now].lazy = 0;
  }
}
long long calc(int now, int l, int r, long long mx) {
  if (l == r) return mx + T[now].mnp;
  int mid = (l + r) >> 1;
  push_down(now);
  if (mx > T[now << 1].mxsuf)
    return min(T[now << 1].mnp + mx, calc(now << 1 | 1, mid + 1, r, mx));
  else
    return min(calc(now << 1, l, mid, mx), T[now].mnr);
}
void update(int now, int l, int r) {
  T[now].mxsuf = max(T[now << 1].mxsuf, T[now << 1 | 1].mxsuf);
  T[now].mnp = min(T[now << 1].mnp, T[now << 1 | 1].mnp);
  int mid = (l + r) >> 1;
  push_down(now);
  T[now].mnr = calc(now << 1 | 1, mid + 1, r, T[now << 1].mxsuf);
}
void modify(int l, int r, int now, int x, int y, long long z) {
  if (r < x || y < l) return;
  if (x <= l && r <= y) return add_lazy(now, z);
  int mid = (l + r) >> 1;
  push_down(now);
  modify(l, mid, now << 1, x, y, z);
  modify(mid + 1, r, now << 1 | 1, x, y, z);
  update(now, l, r);
}
long long mx_left;
int query(int l, int r, int now, int x, int y, long long mx) {
  if (r < x || y < l) return 0;
  if (x <= l && r <= y) {
    mx_left = max(mx_left, T[now].mxsuf);
    if (l == r) {
      if (mx + T[now].mnp <= k)
        return l;
      else
        return 0;
    }
    int mid = (l + r) >> 1;
    push_down(now);
    if (calc(now << 1 | 1, mid + 1, r, max(mx, T[now << 1].mxsuf)) <= k)
      return query(mid + 1, r, now << 1 | 1, x, y, max(mx, T[now << 1].mxsuf));
    else
      return query(l, mid, now << 1, x, y, mx);
  }
  int mid = (l + r) >> 1;
  push_down(now);
  int ret = query(l, mid, now << 1, x, y, mx);
  ret = max(ret, query(mid + 1, r, now << 1 | 1, x, y, max(mx_left, mx)));
  return ret;
}
void build_tree(int l, int r, int now) {
  if (l == r) {
    T[now].mnp = -suf[l];
    T[now].mxsuf = suf[l];
    node[l] = now;
    return;
  }
  int mid = (l + r) >> 1;
  build_tree(l, mid, now << 1);
  build_tree(mid + 1, r, now << 1 | 1);
  update(now, l, r);
}
void init() {
  for (int i = 2; i <= n; ++i) suf[i] = suf[i - 1] + g[i] - w[i - 1];
  for (int i = 2; i <= n; ++i) pre[i] = pre[i - 1] + g[i - 1] - w[i - 1];
  static pair<long long, int> h[MaxN];
  for (int i = 1; i <= n; ++i) h[i] = make_pair(pre[i], i);
  sort(h + 1, h + n + 1);
  set<int> s;
  s.insert(n + 1);
  for (int i = 1; i <= n; ++i) {
    int u = h[i].second, f = *s.upper_bound(u);
    long long cost = pre[u] - pre[f];
    if (f == n + 1) cost = 0;
    G.add_edge(f, u, cost);
    s.insert(u);
  }
  build_tree(1, n, 1);
}
inline long long get_cost(int pos) {
  long long ret = 0;
  for (int i = node[pos]; i; i >>= 1) ret += T[i].lazy;
  return ret;
}
int bins(int l, int r) {
  while (l != r) {
    int mid = (l + r + 1) >> 1;
    if (get_cost(mid - 1) <= k)
      l = mid;
    else
      r = mid - 1;
  }
  return l;
}
void dfs(int now) {
  if (now <= n) {
    mx_left = -inf;
    ans = max(ans, query(1, n, 1, now, bins(now, n), -inf) - now + 1);
  }
  for (int i = G.en[now]; i; i = G.next[i]) {
    modify(1, n, 1, now - 1, n, G.value[i]);
    dfs(G.to[i]);
    modify(1, n, 1, now - 1, n, -G.value[i]);
  }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i < n; ++i) scanf("%d", w + i);
  for (int i = 1; i <= n; ++i) scanf("%d", g + i);
  init();
  dfs(n + 1);
  cout << ans << endl;
  return 0;
}