local mfl, mce, mmi = math.floor, math.ceil, math.min
local SegTree = {}
SegTree.updateAll = function(self)
  for i = self.stagenum - 1, 1, -1 do
    local c = #self.stage[i]
    for j = 1, c - 1 do
      self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])
    end
    if #self.stage[i + 1] < c * 2 then
      self.stage[i][c] = self.stage[i + 1][c * 2 - 1]
    else
      self.stage[i][c] = self.func(self.stage[i + 1][c * 2 - 1], self.stage[i + 1][c * 2])
    end
  end
end
SegTree.create = function(self, ary, func, emptyvalue)
  self.func, self.emptyvalue = func, emptyvalue
  local datasize = #ary
  local datacount = {}
  while 1 < datasize do
    table.insert(datacount, 1, datasize)
    datasize = mce(datasize / 2)
  end
  table.insert(datacount, 1, 1)
  self.stagenum = #datacount
  self.stage, self.size = {}, {}
  local mul = 1
  for i = 1, self.stagenum do
    self.stage[i] = {}
    for j = 1, datacount[i] do self.stage[i][j] = emptyvalue end
    mul = mul * 2
  end
  for i = 1, self.stagenum do
    mul = mul / 2
    self.size[i] = mul
  end
  for i = 1, #ary do self.stage[self.stagenum][i] = ary[i] end
  self:updateAll()
end
SegTree.getRange = function(self, left, right)
  if left == right then return self.stage[self.stagenum][left] end
  local start_stage = 1
  while right - left + 1 < self.size[start_stage] do
    start_stage = start_stage + 1
  end
  local ret = self.emptyvalue
  local t1, t2, t3 = {start_stage}, {left}, {right}
  while 0 < #t1 do
    local stage, l, r = t1[#t1], t2[#t1], t3[#t1]
    table.remove(t1) table.remove(t2) table.remove(t3)
    local sz = self.size[stage]
    if (l - 1) % sz ~= 0 then
      local newr = mmi(r, mce((l - 1) / sz) * sz)
      if newr < r then
        table.insert(t1, stage) table.insert(t2, newr + 1) table.insert(t3, r)
      end
      table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)
    else
      if sz <= r + 1 - l then
        ret = self.func(ret, self.stage[stage][mce(l / sz)])
        l = l + sz
      end
      if l <= r then
        table.insert(t1, 1, stage + 1) table.insert(t2, 1, l) table.insert(t3, 1, r)
      end
    end
  end
  return ret
end
SegTree.decValue = function(self, idx)
  self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] - 1
  for i = self.stagenum - 1, 1, -1 do
    local dst = mce(idx / 2)
    if idx % 2 == 0 then
      self.stage[i][dst] = self.func(self.stage[i + 1][idx - 1], self.stage[i + 1][idx])
    else
      if #self.stage[i + 1] == idx then
        self.stage[i][dst] = self.stage[i + 1][idx]
      else
        self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][idx + 1])
      end
    end
    idx = dst
  end
end
SegTree.new = function(ary, func, emptyvalue)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(ary, func, emptyvalue)
  return obj
end


local n, k = io.read("*n", "*n")
local sum, tmp, conv = {}, {}, {}
sum[1] = io.read("*n") - k
for i = 2, n do
  sum[i] = sum[i - 1] + io.read("*n") - k
end
sum[n + 1] = 0
for i = 1, n + 1 do tmp[i] = sum[i] end
table.sort(tmp)
local sumTypeCount = 1
local sumTypeList = {}
conv[tmp[1]] = 1
sumTypeList[1] = tmp[1]
for i = 2, n + 1 do
  if tmp[i] ~= sumTypeList[sumTypeCount] then
    sumTypeCount = sumTypeCount + 1
    conv[tmp[i]] = sumTypeCount
    sumTypeList[sumTypeCount] = tmp[i]
  end
end
local sumTypeAry = {}
for i = 1, sumTypeCount do sumTypeAry[i] = 0 end
for i = 1, n do
  local j = conv[sum[i]]
  sumTypeAry[j] = sumTypeAry[j] + 1
end
local segtree = SegTree.new(sumTypeAry, function(a, b) return a + b end, 0)
local bias = 0
local cnt = 0
for i = 1, n do
  cnt = cnt + segtree:getRange(conv[bias], sumTypeCount)
  segtree:decValue(conv[sum[i]])
  bias = sum[i]
end
print(cnt)
