import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto L = RD;
	auto R = RD;

	long digit;
	auto tmp = R;
	while (tmp != 0)
	{
		tmp /= 2;
		++digit;
	}

	long ans;
	auto dp1  = new long[][](64, 2);
	dp1[0][0] = 1;
	foreach (i; 0..digit)
	{
		auto j   = digit - i - 1;
		auto bit = 1LU << j;

		dp1[i+1][1].moda(dp1[i][1]*2);
		dp1[i+1][0].moda(dp1[i][0]);
		if (i != 0 && R & bit)
			dp1[i+1][1].moda(dp1[i][0]);

		auto digit2 = digit - i - 1;
		auto dp2    = new long[][](64, 2);
		dp2[0][0]   = 1;
		foreach (k; 0..digit2)
		{
			auto l   = digit2 - k - 1;
			auto bit2 = 1LU << l;

			dp2[k+1][1].moda(dp2[k][1]*2);
			dp2[k+1][0].moda(dp2[k][0]);
			if (!(L & bit2))
				dp2[k+1][1].moda(dp2[k][0]);
		}
		auto d1 = dp1[i+1][0];
		auto d2 = dp2[digit2][0] + dp2[digit2][1];
		debug writeln(d1, " ", d2);
		debug writeln(dp1[i+1]);
		debug writeln(dp2[digit2]);
		d1.modm(d2);
		ans.moda(d1);
	}

	writeln(ans);
	stdout.flush();
	debug readln();
}