#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;
typedef long long LL;
#define int LL

set<int> S1, S2;

struct BIT{
    LL sum[N];

    void add(int x, int v){
        for(int i = x; i < N; i += i & (-i))sum[i] += v;
    }

    LL query(int x){
        LL ans = 0;
        for(int i = x; i > 0; i -= i & (-i))ans += sum[i];
        return ans;
    }
}tr;

int a[N], b[N];
LL sum[N], K;
int numx[N], k;
LL res;

bool check(){
    int a, b;
    if(S1.empty())a = 0;
    else {
        auto it = S1.end();
        it --;
        a = *it;
    }
    if(S2.empty())b = 0;
    else {
        auto it = S2.end();
        it --;
        b = *it;
    }

    if(res + max(a, b) <= K)return 1;
    return 0;
}

int get(LL x){
    return lower_bound(numx + 1, numx + k + 1, x) - numx;
}

signed main(){
    // freopen("top.in", "r", stdin);
    // freopen("top.out", "w", stdout);

    int n;
    scanf("%d%lld", &n, &K);

    for(int i = 1; i <= n; i ++)scanf("%d", &a[i]);
    for(int i = 1; i <= n; i ++)scanf("%d", &b[i]);

    for(int i = 1; i <= n; i ++){
        sum[i] = sum[i - 1] + b[i] - a[i];
        numx[++ k] = sum[i];
    }

    sort(numx + 1, numx + k + 1);
    k = unique(numx + 1, numx + k + 1) - numx - 1;


    int j = 1;
    LL ans = 0;
    for(int i = 1; i <= n; i ++){
        while(j <= n){
            if(a[j] >= b[j]){
                res += (a[j] - b[j]);
                S2.insert(b[j]);
            }
            else S1.insert(a[j]);
            tr.add(get(sum[j]), 1);
            if(!check()){
                if(a[j] >= b[j]){
                    res -= (a[j] - b[j]);
                    S2.erase(b[j]);
                }
                else S1.erase(a[j]);
                tr.add(get(sum[j]), -1);
                break;
            }
            j ++;
        }
        
        // printf("%d ", j - i);
        // printf("%d\n", tr.query(get(sum[i - 1]) - 1));

        ans += j - i - tr.query(get(sum[i - 1]) - 1);
        tr.add(get(sum[i]), -1);
        if(a[i] >= b[i]){
            res -= (a[i] - b[i]);
            S2.erase(b[i]);
        }
        else S1.erase(a[i]);

        // printf("%d\n", ans);
    }

    printf("%lld\n", ans);
}