zvrk

문제

By removing all digits left of the rightmost digit one in the binary representation of some integer, we get what is called the "zvrk" of that number. 

For example, the zvrk of 6 i.e. (110)₂ is 2 i.e. (10)₂, and the zvrk of 40 i.e. (101000)₂ is 8 i.e. (1000)₂. 

Write a program that will calculate the sum of the zvrks of all numbers between two given numbers A and B (inclusive). 

입력

First and only line of input contains two integers A and B, 1 ≤ A ≤ B ≤ 10¹⁵.

출력

First and only line of output should contain the sum from the problem statement. 

Note: the result will fit into the 64-bit signed integer type (int64 in Pascal, long long in C/C++).

176 177

17

5 9

13

25 28

8