#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  s= 0, e = n-1;
	int ans = 0;
	
	//* keep in mind  s<e   (Not s<=e )
	while(s<e){
		int sum = a[s] + a[e];
		if(sum > k){
			ans += (e-s);
			e--;
		}
		else{
			s++;
		}
	}
	
	return ans;
	
}


//* Template 2

//* Think it as Reverse sliding window , 
//* 	Expand Valid window => 
//* 		sum > k 
//* 		e is decreasing (instead of increasing ) 

//* 	Shrink Invalid window => sum <= k

int consistency2(int n, int k) {

	int  s= 0, e = n-1;
	int ans = 0;
	
	
	while(e>=0){
		int sum = a[s] + a[e];
		
		//* Invalid window : Shrink (cache invalidation style)
		while(s<e && a[s]+a[e] <= k) s++;
		if(s==e) break;
		
		//* Valid window : Expand (e-- here)
		ans += (e-s);
		e--;
	}
	
	return ans;
	
}












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

	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;
}