Problem:
Score : 600 points

Problem Statement

Given are integers L and R. Find the number, modulo 10^9 + 7, of pairs of integers (x, y) (L \leq x \leq y \leq R) such that the remainder when y is divided by x is equal to y \mbox{ XOR } x.

What is \mbox{ XOR }?

The XOR of integers A and B, A \mbox{ XOR } B, is defined as follows:

When A \mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.

For example, 3 \mbox{ XOR } 5 = 6. (In base two: 011 \mbox{ XOR } 101 = 110.)

Constraints

1 \leq L \leq R \leq 10^{18}

Input

Input is given from Standard Input in the following format:

L R

Output

Print the number of pairs of integers (x, y) (L \leq x \leq y \leq R) satisfying the condition, modulo 10^9 + 7.

Sample Input 1

2 3

Sample Output 1

3

Three pairs satisfy the condition: (2, 2), (2, 3), and (3, 3).

Sample Input 2

10 100

Sample Output 2

604

Sample Input 3

1 1000000000000000000

Sample Output 3

68038601

Be sure to compute the number modulo 10^9 + 7.

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

fn read_stdin() -> String {
    use std::io::Read;
    let mut input = String::new();
    std::io::stdin().read_to_string(&mut input).unwrap();
    input
}

fn scan<'a, I: Iterator<Item = &'a str>, T: std::str::FromStr>(tokens: &mut I) -> T {
    tokens.next().unwrap().parse().ok().unwrap()
}

const MODULO: usize = 1_000_000_007;

fn main() {
    let input = read_stdin();
    let tokens = &mut input.split_whitespace();
    let l: usize = scan(tokens);
    let r: usize = scan(tokens);
    println!("{}", f(l, r, 63));
}

fn f(l: usize, r: usize, s: usize) -> usize {
    let b = 1 << s;
    if r < b {
        f(l, r, s - 1)
    } else if l < b {
        (k(l, s) + h(r - b, s)) % MODULO
    } else {
        g(l - b, r - b, s - 1)
    }
}

fn g(l: usize, r: usize, s: usize) -> usize {
    let b = 1 << s;
    if l > r {
        0
    } else if l == r {
        1
    } else if r < b {
        g(l, r, s - 1)
    } else if l < b {
        (k(l, s) + g(l, r - b, s) + h(r - b, s)) % MODULO
    } else {
        g(l - b, r - b, s)
    }
}

fn h(x: usize, s: usize) -> usize {
    let b = 1 << s;
    if x == 0 {
        1
    } else if x < b {
        h(x, s - 1)
    } else {
        (power(3, s) + 2 * h(x - b, s)) % MODULO
    }
}

fn k(x: usize, s: usize) -> usize {
    if s == 0 {
        1
    } else if x < 1 << (s - 1) {
        (k(x, s - 1) + power(3, s - 1)) % MODULO
    } else {
        h((1 << s) - 1 - x, s)
    }
}

fn power(mut b: usize, mut e: usize) -> usize {
    let mut a = 1;
    while e != 0 {
        if e & 1 != 0 {
            a = a * b % MODULO;
        }
        b = b * b % MODULO;
        e >>= 1;
    }
    a
}