return x&(-x)

while i<n
   btree[i]=btree[i]+v
   i=i+lowbit(i)
endwhile

res=0
while i>0
   res=res+btree[i]
   i=i-lowbit(i)
endwhile
return res

for i=1 to n
   update(i,v) endfor
res=sum(r)-sum(l-1)

update(l,v)
update(r+1,-v)
res=sum(i)

p=i
while i<n
   sum1[i]=sum1+v
   sum2[i]=sum2+p*v
   i=i+lowbit(i)
endwhile

res=0
p=i
while i>0
   res=res+(p+1)*sum1[i]-sum2[i]
   i=i=lowbit(i)
endwhile
return res

update(l,v)
update(r+1,-v)
res=sum(r)-sum(l-1)

for i=x to n step lowbit(i)
   for j=y to n step lowbit(j)
      btree[i][j]=btree[i][j]+v

res=0
for i=x to 1 step lowbit(i)
   for j=y to 1 step lowbit(j)
      res=res+btree[i][j]
return res

x=x-1
y=y-1
return sum(xx,yy)+sum(x,y)-query(xx,y)-query(x,yy)

update(x,y,v)
update(x,yy+1,-v)
update(xx+1,y,-v)
update(xx+1,yy+1,v)
sum(a,b)

for i=x to n step lowbit(i)
   for j=y to n step lowbit(j)
      btree1[i][j]=v
      btree2[i][j]=v*x
      btree3[i][j]=v*y
      btree4[i][j]=v*x*y

res=0
for i=x to 1 step lowibt(i)
   for j=y to 1 step lowbit(j)
      res=res+(x+1)*(y+1)*btree1[i][j]-(y+1)*btree2[i][j]-(x+1)*btree3[i][j]+btree4[i][j]
return res

update(x,y,v)
update(x,yy+1,-v)
update(xx+1,y,-v)
update(xx+1,yy+1,v)
return sum(aa,bb)+sum(a-1,b-1)-sum(a-1,bb)-sum(aa,b-1)