## 「AtCoder 138F」Coincidence

Given are integers L and R. Find the number, modulo $10^9+7$, of pairs of integers $(x,y) (L≤x≤y≤R)$ such that the remainder when y is divided by x is equal to $y[mbox]XORx$.

## 「HDU 4734」 F(x)

For a decimal number x with n digits (A nA n-1A n-2 ... A 2A 1), we define its weight as F(x) = A n * 2 n-1 + A n-1 * 2 n-2 + ... + A 2 * 2 + A 1 * 1. Now you are given two numbers A and B, please calculate how many numbers are there between 0 and B, inclusive, whose weight is no more than F(A).