import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

const long p = 1_000_000_000 + 7;


void main(){
    long n, k;
    readlnTo(n, k);
    long[] a;
    foreach(i; iota(n)) {
        a ~= readLong();
    }
    long[] s;
    s ~= 0;
    foreach(i; iota(n)) {
        s ~= s.back + a[i] - k;
    }
    auto t = s.dup();
    t.sort();
    long[long] h;
    foreach(ti; t.uniq()) {
        h[ti] = h.length + 1;
    }

    auto bit = new long[](n+2);
    void add(long i) {
        if(i < n+2) {
            bit[i] += 1;
            add(i + (i & -i));
        }
    }
    long sum(long i) {
        if(i == 0) {
            return 0;
        }
        return bit[i] + sum(i - (i & -i));
    }
    long ans = 0;
    foreach(si; s) {
        ans += sum(h[si]);
        add(h[si]);
    }
    writeln(ans);
}

