#include<iostream>

#include<cstdlib>

#include<cstring>

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cmath>

#include<map>

#define ll long long

using namespace std;

const int maxn=,inf=1e9;

int n,m,l,r,L,R,K;

int q[maxn],Q[maxn],a[maxn];

ll ans;

void read(int &k)

{

    int f=;k=;char c=getchar();

    while(c<''||c>'')c=='-'&&(f=-),c=getchar();

    while(c<=''&&c>='')k=k*+c-'',c=getchar();

    k*=f;

}

int main()

{

    read(n);read(K);

    for(int i=;i<=n;i++)read(a[i]);

    l=;r=;L=;R=;

    for(int i=,j=;i<=n;i++)

    {

        while(j<=n)

        {

            while(l<=r&&a[q[r]]>=a[j])r--;

            while(L<=R&&a[Q[R]]<=a[j])R--;

            q[++r]=Q[++R]=j;

            if(a[Q[L]]-a[q[l]]>K)break;

            j++;

        }

        ans+=j-i;

        q[l]==i&&(l++);Q[L]==i&&(L++);

    }

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

    return ;

}