class SegmentTree
  
  def initialize
    @N=2**17
    @Z=0
    @seg=Array.new(2*@N-1){@Z}
    @lazy=Array.new(2*@N-1){@Z}
  end
  
  def update(i, l, r)
    if @lazy[i].nonzero?
      @seg[i]+=@lazy[i]*(r-l)
      if r-l>1
        @lazy[2*i+1]+=@lazy[i]
        @lazy[2*i+2]+=@lazy[i]
      end
      @lazy[i]=0
    end
  end
  
  def add(a, b, x, i=0, l=0, r=@N)
    update(i, l, r)
    if b<=l or r<=a
      return
    elsif a<=l and r<=b
      @lazy[i]+=x
      update(i, l, r)
    else
      m=(r+l)/2
      add(a, b, x, 2*i+1, l, m)
      add(a, b, x, 2*i+2, m, r)
      @seg[i]=@seg[2*i+1]+@seg[2*i+2]
    end
  end
  
  def sum(a, b, i=0, l=0, r=@N)
    update(i, l, r)
    if b<=l or r<=a
      @Z
    elsif a<=l and r<=b
      @seg[i]
    else
      m=(r+l)/2
      vl=sum(a, b, 2*i+1, l, m)
      vr=sum(a, b, 2*i+2, m, r)
      vl+vr
    end
  end
  
end

st=SegmentTree.new
n, q=gets.split.map(&:to_i)
q.times do
  query=gets.chomp
  case query[0].to_i
  when 0
    c, s, t, x=query.split.map(&:to_i)
    st.add(s-1, t, x)
  when 1
    c, s, t=query.split.map(&:to_i)
    puts st.sum(s-1, t)
  end
end