#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************



vector<int> a;

int consistency1(int n, int k) {

	int ans = 0;
	int s = 0, e = 0;
	
	while(e<n && s<n-1){
		if(e==s) e++;
		if(a[e] - a[s] > k){
			s++;
		}
		else{
			ans += (e-s);
			e++;
		}
	}
	return ans;
	
}


//* Template 2 : 
//* 	Invalid window => sum > k   
//* 	Valid window   =>  sum <= k

int consistency2(int n, int k) {

	
	int ans = 0;
	int s = 0, e = 0;
	
	while(e<n && s<n-1){
		if(e==s) e++;
		
		while(s<e && a[e]-a[s] > k) s++;
		if(s==e) continue;
		
		ans += (e-s);
		e++;
	}
	return ans;
	
}









int practice(int n, int k) {
	
	int ans = 0;



	return ans;
}


void solve() {
    
	int n, k;
	cin >> n >> k;
	
	a.resize(n);
	
	for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n, k) << " " <<  consistency2(n, k) << endl;
 
    // cout << consistency1(n, k) << " -> " << practice(n, k) << endl;

}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}