def fadd(st,no,p1,n,l2,r2)
if r2<p1 || p1<l2 then
return
elsif l2==r2 then
return st[no]+=n
else
st[no]+=n
m=(l2+r2)/2
if p1<=m then
fadd(st,no*2+1,p1,n,l2,m)
else
fadd(st,no*2+2,p1,n,m+1,r2)
end
end
end
def fsum(st,no,l,r,l2,r2)
if r<l2 || r2<l then
return 0
elsif l2==r2 then
return st[no]
elsif l<=l2 && r2<=r then
return st[no]
else
m=(l2+r2)/2
res=fsum(st,no*2+1,l,r,l2,m)
res+=fsum(st,no*2+2,l,r,m+1,r2)
return res
end
end
st=array.new(270000,0)
maxr=131071
fadd(st,0,44,100,0,maxr)
l,r=gets.split(" ").map{|e| e.to_i}
p fsum(st,0,l,r,0,maxr)