#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > struct getv_fmt;
template <> struct getv_fmt<       int >{ static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt< long long >{ static constexpr const char *fmt = "%lld"; };
template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

// セグメント木のユーティリティ
inline int chl( const int k )
{
	return k * 2 + 1;
}

inline int chr( const int k )
{
	return k * 2 + 2;
}

inline int mid( const int l, const int r )
{
	return ( l + r ) / 2;
}

#define LEFT( k, l, r ) chl( k ), l, mid( l, r )
#define RIGHT( k, l, r ) chr( k ), mid( l, r ), r

// RangeTree
// 区間内にある値未満 or 超過の要素数を数える
// 初期化 O( N log N )
// クエリ O( N log^2 N )
namespace SegmentTree
{
	template < typename T >
	class RangeTree
	{
		const int N;
		std::vector< std::vector< T > > data;

	public:
		RangeTree( const std::vector< T > &src ) : N( src.size() ), data( 4 * N )
		{
			init( src, 0, 0, N );
			return;
		}

		void init( const std::vector< T > &src, const int k, const int l, const int r )
		{
			if ( l + 1 == r )
			{
				data[k].push_back( src[l] );
				return;
			}

			init( src, LEFT( k, l, r  ) );
			init( src, RIGHT( k, l, r ) );

			std::merge(
					data[ chl( k ) ].begin(), data[ chl( k ) ].end(),
					data[ chr( k ) ].begin(), data[ chr( k ) ].end(),
					std::back_inserter( data[k] ) );

			return;
		}

		int count( const T x, const int a, const int b, bool less = true )
		{
			return count( x, a, b, less, 0, 0, N );
		}

		int count( const T x, const int a, const int b, bool less, const int k, const int l, const int r )
		{
			if ( r <= a || b <= l )
			{
				return 0;
			}
			else if ( a <= l && r <= b )
			{
				if ( less )
				{
					return lower_bound( data[k].begin(), data[k].end(), x ) - data[k].begin();
				}
				else
				{
					return data[k].end() - upper_bound( data[k].begin(), data[k].end(), x );
				}
			}
			else
			{
				return count( x, a, b, less, LEFT( k, l, r ) ) + count( x, a, b, less, RIGHT( k, l, r ) );
			}
		}
	};
}
// RangeTree( src )
// count( value, a, b, less flag )

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	int N, K;
	scanf( "%d%d", &N, &K );
	
	VI A( N );
	getv( A );

	VT< LL > psum( 1, 0 );
	{
		VT< LL > ds;
		ds.reserve( N );
		psum.reserve( N + 1 );
		transform( ALL( A ), BI( ds ), bind( minus< int >(), _1, K ) );
		partial_sum( ALL( ds ), BI( psum ) );
	}

	LL res = 0;
	SegmentTree::RangeTree< LL > rangetree( psum );
	REP( i, N )
	{
		res += rangetree.count( psum[i] - 1, i + 1, N + 1, false );
	}

	printf( "%lld\n", res );
	fflush( stdout );

	return 0;
}


Measured memory_bytes: 65892