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;
template <class T>
inline void chkmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void chkmin(T &a, T b) {
  if (a > b) a = b;
}
inline int read() {
  int sum = 0, p = 1;
  char ch = getchar();
  while (!(('0' <= ch && ch <= '9') || ch == '-')) ch = getchar();
  if (ch == '-') p = -1, ch = getchar();
  while ('0' <= ch && ch <= '9') sum = sum * 10 + ch - 48, ch = getchar();
  return sum * p;
}
const int maxn = 1e5 + 20;
const long long inf = 1ll << 60;
struct node {
  int v, next;
  long long w;
};
node e[maxn << 1];
int cnt, start[maxn];
inline void addedge(int u, int v, long long w) {
  e[++cnt] = (node){v, start[u], w};
  start[u] = cnt;
}
int n, k;
long long pre[maxn], suf[maxn];
int w[maxn], g[maxn];
int fa[maxn];
long long faw[maxn];
int R[maxn];
int chain[maxn], tp, now;
long long dj[maxn];
void dfs(int u) {
  chain[++tp] = u;
  while (now < tp && dj[tp] - dj[now + 1] > k) now++;
  R[u] = chain[now] - 1;
  int Now = now;
  for (int i = start[(u)]; i; i = e[i].next)
    dj[tp + 1] = dj[tp] + e[i].w, dfs(e[i].v), now = Now;
  --tp;
}
struct Node {
  long long ans, smx, mx, lz;
};
Node c[(1 << 18) + 20];
inline void Add(int o, long long d) {
  c[o].ans += d;
  c[o].smx += d;
  c[o].lz += d;
}
inline void pushdown(int o) {
  if (c[o].lz) {
    Add((o << 1), c[o].lz);
    Add((o << 1 | 1), c[o].lz);
    c[o].lz = 0;
  }
}
long long queryans(long long smx, int o, int l, int r) {
  if (l == r) return smx == -inf ? inf : smx - c[o].mx;
  int mid = l + r >> 1;
  pushdown(o);
  if (smx < c[(o << 1)].smx)
    return min(queryans(smx, (o << 1), l, mid), c[o].ans);
  else
    return min(smx - c[(o << 1)].mx, queryans(smx, (o << 1 | 1), mid + 1, r));
}
void Merge(int o, int l, int r) {
  int mid = l + r >> 1;
  c[o].smx = max(c[(o << 1)].smx, c[(o << 1 | 1)].smx);
  c[o].ans = queryans(c[(o << 1)].smx, (o << 1 | 1), mid + 1, r);
}
inline void make_tree(int o, int l, int r) {
  if (l == r) return c[o].ans = inf, c[o].smx = c[o].mx = suf[l], void();
  int mid = l + r >> 1;
  make_tree((o << 1), l, mid);
  make_tree((o << 1 | 1), mid + 1, r);
  c[o].mx = max(c[(o << 1)].mx, c[(o << 1 | 1)].mx);
  Merge(o, l, r);
}
void update(int ql, int qr, long long d, int o, int l, int r) {
  if (ql <= l && r <= qr) return Add(o, d), void();
  int mid = l + r >> 1;
  pushdown(o);
  if (ql <= mid) update(ql, qr, d, (o << 1), l, mid);
  if (qr > mid) update(ql, qr, d, (o << 1 | 1), mid + 1, r);
  Merge(o, l, r);
}
long long Pre[maxn];
int om[maxn], lm[maxn], rm[maxn];
void query(int ql, int qr, int o, int l, int r) {
  if (ql <= l && r <= qr)
    return ++tp, om[tp] = o, lm[tp] = l, rm[tp] = r, void();
  int mid = l + r >> 1;
  pushdown(o);
  if (ql <= mid) query(ql, qr, (o << 1), l, mid);
  if (qr > mid) query(ql, qr, (o << 1 | 1), mid + 1, r);
}
int Query(long long x, int o, int l, int r) {
  if (l == r) return l;
  pushdown(o);
  int mid = l + r >> 1;
  if (queryans(max(x, c[(o << 1)].smx), (o << 1 | 1), mid + 1, r) <= k)
    return Query(max(x, c[(o << 1)].smx), (o << 1 | 1), mid + 1, r);
  else
    return Query(x, (o << 1), l, mid);
}
inline int QUERY(int l, int r) {
  tp = 0;
  query(l, r, 1, 1, n);
  Pre[0] = -inf;
  for (int i = (1), _end_ = (tp); i <= _end_; i++)
    Pre[i] = max(Pre[i - 1], c[om[i]].smx);
  for (int i = (tp), _end_ = (1); i >= _end_; i--) {
    if (queryans(Pre[i - 1], om[i], lm[i], rm[i]) <= k)
      return Query(Pre[i - 1], om[i], lm[i], rm[i]);
  }
  return l;
}
inline void init() {
  n = read();
  k = read();
  for (int i = (1), _end_ = (n - 1); i <= _end_; i++) w[i] = read();
  for (int i = (1), _end_ = (n); i <= _end_; i++) g[i] = read();
  for (int i = (1), _end_ = (n - 1); i <= _end_; i++)
    pre[i] = pre[i - 1] + g[i] - w[i];
  for (int i = (2), _end_ = (n); i <= _end_; i++)
    suf[i] = suf[i - 1] + g[i] - w[i - 1];
  static int st[maxn];
  int top = 0;
  for (int i = (1), _end_ = (n); i <= _end_; i++) {
    while (top && pre[st[top] - 1] > pre[i - 1])
      faw[st[top]] = pre[st[top] - 1] - pre[i - 1], fa[st[top--]] = i;
    st[++top] = i;
  }
  for (int i = (1), _end_ = (n); i <= _end_; i++)
    if (!fa[i]) fa[i] = n + 1;
  for (int i = (1), _end_ = (n); i <= _end_; i++) addedge(fa[i], i, faw[i]);
  now = 1;
  dfs(n + 1);
  make_tree(1, 1, n);
}
int ans;
void dfs1(int u) {
  if (faw[u]) update(fa[u] - 1, n, faw[u], 1, 1, n);
  if (u <= R[u]) chkmax(ans, QUERY(u, R[u]) - u + 1);
  for (int i = start[(u)]; i; i = e[i].next) dfs1(e[i].v);
  if (faw[u]) update(fa[u] - 1, n, -faw[u], 1, 1, n);
}
inline void doing() {
  dfs1(n + 1);
  printf("%d\n", ans);
}
int main() {
  init();
  doing();
  return 0;
}