#include <iostream>
#include <string>
#include <random>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
using namespace std;

namespace fastinput {
	/** Interface */

	template <class T = int> inline T readInt();
	inline double readDouble();
	inline int readUInt();
	inline int readChar();
	inline void readWord(char *s);
	inline bool readLine(char *s); // do not save '\n'
	inline bool isEof();
	inline int peekChar();
	inline bool seekEof();

	template <class T> inline void writeInt(T x, int len = -1);
	template <class T> inline void writeUInt(T x, int len = -1);
	inline void writeChar(int x);
	inline void writeWord(const char *s);
	inline void writeDouble(double x, int len = 0);
	inline void flush();

	/** Read */

	static const int buf_size = 4096;

	static char buf[buf_size];
	static int buf_len = 0, buf_pos = 0;

	inline bool isEof() {
		if (buf_pos == buf_len) {
			buf_pos = 0, buf_len = fread(buf, 1, buf_size, stdin);
			if (buf_pos == buf_len)
				return 1;
		}
		return 0;
	}

	inline int getChar() {
		return isEof() ? -1 : buf[buf_pos++];
	}

	inline int peekChar() {
		return isEof() ? -1 : buf[buf_pos];
	}

	inline bool seekEof() {
		int c;
		while ((c = peekChar()) != -1 && c <= 32)
			buf_pos++;
		return c == -1;
	}

	inline int readChar() {
		int c = getChar();
		while (c != -1 && c <= 32)
			c = getChar();
		return c;
	}

	inline int readUInt() {
		int c = readChar(), x = 0;
		while ('0' <= c && c <= '9')
			x = x * 10 + c - '0', c = getChar();
		return x;
	}

	template <class T>
	inline T readInt() {
		int s = 1, c = readChar();
		T x = 0;
		if (c == '-')
			s = -1, c = getChar();
		while ('0' <= c && c <= '9')
			x = x * 10 + c - '0', c = getChar();
		return s == 1 ? x : -x;
	}

	inline double readDouble() {
		int s = 1, c = readChar();
		double x = 0;
		if (c == '-')
			s = -1, c = getChar();
		while ('0' <= c && c <= '9')
			x = x * 10 + c - '0', c = getChar();
		if (c == '.') {
			c = getChar();
			double coef = 1;
			while ('0' <= c && c <= '9')
				x += (c - '0') * (coef *= 0.1), c = getChar();
		}
		return s == 1 ? x : -x;
	}

	inline void readWord(char *s) {
		int c = readChar();
		while (c > 32)
			*s++ = c, c = getChar();
		*s = 0;
	}

	inline bool readLine(char *s) {
		int c = getChar();
		while (c != '\n' && c != -1)
			*s++ = c, c = getChar();
		*s = 0;
		return c != -1;
	}

	/** Write */

	static int write_buf_pos = 0;
	static char write_buf[buf_size];

	inline void writeChar(int x) {
		if (write_buf_pos == buf_size)
			fwrite(write_buf, 1, buf_size, stdout), write_buf_pos = 0;
		write_buf[write_buf_pos++] = x;
	}

	inline void flush() {
		if (write_buf_pos)
			fwrite(write_buf, 1, write_buf_pos, stdout), write_buf_pos = 0;
	}

	template <class T>
	inline void writeInt(T x, int output_len) {
		if (x < 0)
			writeChar('-'), x = -x;

		char s[24];
		int n = 0;
		while (x || !n)
			s[n++] = '0' + x % 10, x /= 10;
		while (n < output_len)
			s[n++] = '0';
		while (n--)
			writeChar(s[n]);
	}

	template <class T>
	inline void writeUInt(T x, int output_len) {
		char s[24];
		int n = 0;
		while (x || !n)
			s[n++] = '0' + x % 10, x /= 10;
		while (n < output_len)
			s[n++] = '0';
		while (n--)
			writeChar(s[n]);
	}

	inline void writeWord(const char *s) {
		while (*s)
			writeChar(*s++);
	}

	inline void writeDouble(double x, int output_len) {
		if (x < 0)
			writeChar('-'), x = -x;
		int t = (int)x;
		writeUInt(t), x -= t;
		writeChar('.');
		for (int i = output_len - 1; i > 0; i--) {
			x *= 10;
			t = std::min(9, (int)x);
			writeChar('0' + t), x -= t;
		}
		x *= 10;
		t = std::min(9, (int)(x + 0.5));
		writeChar('0' + t);
	}
}

using namespace fastinput;

const int N = 2e5 + 1;
long long pref[N];
int n;

struct node {
	node* L, *R;
	long long x, y;
	int size;
	node(long long key) {
		y = rand();
		x = key;
		size = 1;
		L = R = NULL;
	}
};

int size(node* t) {
	return t == NULL ? 0 : t->size;
}

void update(node* x) {
	x->size = size(x->L) + 1 + size(x->R);
}

node* merge(node* a, node* b) {
	if (b == NULL) return a;
	if (a == NULL) return b;
	if (a->y > b->y) {
		a->R = merge(a->R, b);
		update(a);
		return a;
	} else {
		b->L = merge(a, b->L);
		update(b);
		return b;
	}
}

pair <node*, node*> split(node* t, long long key) {
	if (t == NULL)
		return { t, t };
	if (t->x <= key) {
		auto lr = split(t->R, key);
		t->R = lr.first;
		update(t);
		lr.first = t;
		return lr;
	} else {
		auto lr = split(t->L, key);
		t->L = lr.second;
		update(t);
		lr.second = t;
		return lr;
	}
}


node* root = NULL;


void insert(long long key) {
	auto lr = split(root, key);
	auto lr2 = split(lr.first, key - 1);
	root = merge(merge(lr2.first, merge(lr2.second, new node(key))), lr.second);
}


int main() {
	::ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	n = readInt();
	int k = readInt();
	for (int i = 0; i < n; ++i)
		pref[i + 1] = readInt() + pref[i] - k;

	long long ans = 0;
	for (int i = 0; i < n; ++i) {
		insert(pref[i]);
		//check pref[i + 1];
		auto lr = split(root, pref[i + 1]);
		ans += size(lr.first);
		root = merge(lr.first, lr.second);
	}
	cout << ans << endl;

	return 0;
}

Measured memory_bytes: 11264