import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static BigInteger func(int num) {
        BigInteger[] bigIntegers = new BigInteger[51];
        bigIntegers[1] = BigInteger.valueOf(1);
        bigIntegers[2] = BigInteger.valueOf(2);
        for(int i = 3;i <=num;i++) {
            bigIntegers[i] = bigIntegers[i-1].add(bigIntegers[i-2]);
        }
        return bigIntegers[num];
    }

    public static void main(String[] args) {
        @SuppressWarnings("resource")
        Scanner inScanner = new Scanner(System.in);
        int number = inScanner.nextInt();
        while(number-->0) {
            int a = inScanner.nextInt();
            int b = inScanner.nextInt();
            System.out.println(func(b-a));
        }
    }

}

#include <iostream>
using namespace std;
long long fun(int n)
{
    long long a[51];                 
    a[1]=1;
    a[2]=2;
    for(int i=3;i<=n;i++)             //可以用这个递推方法，减少计算量。注意运用数组。
        a[i]=a[i-1]+a[i-2];
    return a[n];
}
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        int a,b;
        cin>>a>>b;
        printf("%lld\n",fun(b-a));
    }
    return 0;
}