Amount of Degrees （数位dp）

Create a code to determine the amount of integers, lying in the set [ X; Y] and being a sum of exactly K different integer degrees of B.

Example. Let X=15, Y=20, K=2, B=2. By this example 3 numbers are the sum of exactly two integer degrees of number 2:

17 = 2 ^{4+20,
18 = 24+21,
20 = 24+22.}

Input

The first line of input contains integers X and Y, separated with a space (1 ≤  X ≤  Y ≤ 2