#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 1e6 + 5;
ll n, b, a[N];
void Task() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen("FRIEND.inp", "r")) {
freopen("FRIEND.inp", "r", stdin);
freopen("FRIEND.out", "w", stdout);
}
}
void Solve() {
cin >> n >> b;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
ll dem = 0;
for (int i = 1; i <= n; i++) {
ll j1 = lower_bound(a + 1, a + n + 1, b - a[i]) - a;
ll j2 = upper_bound(a + 1, a + n + 1, b - a[i]) - a - 1;
if (b - a[i] < a[i]) {
dem += j2 - j1 + 1;
}
}
cout << dem << "\n";
}
int main() {
Task();
Solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGxsIE4gPSAxZTYgKyA1OwpsbCBuLCBiLCBhW05dOwp2b2lkIFRhc2soKSB7CiAgICBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUoMCk7CiAgICBjb3V0LnRpZSgwKTsKICAgIGlmIChmb3BlbigiRlJJRU5ELmlucCIsICJyIikpIHsKICAgICAgICBmcmVvcGVuKCJGUklFTkQuaW5wIiwgInIiLCBzdGRpbik7CiAgICAgICAgZnJlb3BlbigiRlJJRU5ELm91dCIsICJ3Iiwgc3Rkb3V0KTsKICAgIH0KfQoKdm9pZCBTb2x2ZSgpIHsKICAgIGNpbiA+PiBuID4+IGI7CiAgICBmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspIGNpbiA+PiBhW2ldOwogICAgc29ydChhICsgMSwgYSArIG4gKyAxKTsKICAgIGxsIGRlbSA9IDA7CiAgICBmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspIHsKICAgICAgICBsbCBqMSA9IGxvd2VyX2JvdW5kKGEgKyAxLCBhICsgbiArIDEsIGIgLSBhW2ldKSAtIGE7CiAgICAgICAgbGwgajIgPSB1cHBlcl9ib3VuZChhICsgMSwgYSArIG4gKyAxLCBiIC0gYVtpXSkgLSBhIC0gMTsgCiAgICAgICAgaWYgKGIgLSBhW2ldIDwgYVtpXSkgewogICAgICAgICAgICBkZW0gKz0gajIgLSBqMSArIDE7CiAgICAgICAgfQogICAgfQogICAgY291dCA8PCBkZW0gPDwgIlxuIjsKfQoKaW50IG1haW4oKSB7CiAgICBUYXNrKCk7CiAgICBTb2x2ZSgpOwogICAgcmV0dXJuIDA7Cn0K