8001.fibonacciSum.py

mod = 10**9 + 7
cache = {0: 1, 1: 1}
def fibo(x):
	try:
		return cache[x]
	except KeyError:
		pass
	k = x / 2
	if x % 2:
		cache[x] = (fibo(k) * (2*fibo(k-1) + fibo(k))) % mod
		return cache[x]
	else:
		cache[x] = (fibo(k - 1)**2 + fibo(k)**2) % mod
		return cache[x]
for _ in xrange(int(raw_input())):
	n, m = map(int, raw_input().split())
	print (fibo(m + 1) - fibo(n)) % mod